C语言一般难度题，一般难度题

img


#include 
#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 TriangleArea(l, h) ((l) * (h) / 2.0)

int main()
{
    double a;
    a = TriangleArea(2.5, 1.2);
    printf("%g", a);
    return 0;
}



#define TriangleArea(b, h) (((b) * (h)) / 2.0)


#include<stdio.h>
#define TriangleArea(a,b) a*b/2.0

int main()
{
    double b, h, a;
    scanf("%lf%lf",&b,&h);
    a = TriangleArea(b, h);
    printf("%g\n",a);
    return 0;
}