#include <stdio.h>
#define N 20
typedef struct
{
char no[10];
int score;
}RECORD;
int find(RECORD a[], int n,RECORD b[]);
int main()
{
RECORD x[N],y[N];
int n,i,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",x[i].no);
scanf("%d",&x[i].score);
}
k=find(x,n,y);
for(i=0;i<k;i++)
printf("%s %d\n",y[i].no,y[i].score);
return 0;
}
/* 请在这里填写答案 */
#include <stdio.h>
#define N 20
typedef struct
{
char no[10];
int score;
}RECORD;
int find(RECORD a[], int n, RECORD b[]);
int main()
{
RECORD x[N], y[N];
int n, i, k;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%s", x[i].no);
scanf("%d", &x[i].score);
}
k = find(x, n, y);
for (i = 0; i < k; i++)
printf("%s %d\n", y[i].no, y[i].score);
return 0;
}
/* 请在这里填写答案 */
int find(RECORD a[], int n, RECORD b[])
{
int i = 0, j = 0;
for (i = 0; i < n; ++i) {
if (a[i].score >= 60 && a[i].score < 80) {
b[j++] = a[i];
}
}
return j;
}
运行结果
int find(RECORD a[], int n, RECORD b[])
{
int m = 0;
for (int i = 0; i < n; i++)
{
if (a[i].score >= 60 && a[i].score <= 79)
b[m++] = a[i];
}
return m;
}