73 lines
1.2 KiB
C
73 lines
1.2 KiB
C
|
#include <stdio.h>
|
||
|
|
#pragma GCC optimize("Ofast,inline")
|
||
|
|
#define MAX 21
|
||
|
|
|
||
|
|
typedef struct STUDENT {
|
||
|
|
char name[MAX];
|
||
|
|
char id[MAX];
|
||
|
|
int scores[5];
|
||
|
|
float avg;
|
||
|
|
int sum;
|
||
|
|
} STUDENT;
|
||
|
|
|
||
|
|
void sort(int *arr, int n);
|
||
|
|
|
||
|
|
int main(void) {
|
||
|
|
STUDENT dude;
|
||
|
|
|
||
|
|
// Get name
|
||
|
|
char ch;
|
||
|
|
int loc = 0;
|
||
|
|
while ((ch = getc(stdin)) != '\n') {
|
||
|
|
dude.name[loc++] = ch;
|
||
|
|
}
|
||
|
|
dude.name[loc] = '\0';
|
||
|
|
|
||
|
|
// Get id
|
||
|
|
loc = 0;
|
||
|
|
while ((ch = getc(stdin)) != '\n') {
|
||
|
|
dude.id[loc++] = ch;
|
||
|
|
}
|
||
|
|
dude.id[loc] = '\0';
|
||
|
|
|
||
|
|
// Get scores
|
||
|
|
int sum = 0;
|
||
|
|
for (int i = 0; i < 5; i++) {
|
||
|
|
scanf("%d", &dude.scores[i]);
|
||
|
|
sum += dude.scores[i];
|
||
|
|
}
|
||
|
|
|
||
|
|
// Populate avg and sum;
|
||
|
|
dude.sum = sum;
|
||
|
|
dude.avg = (float)sum / 5;
|
||
|
|
|
||
|
|
sort(dude.scores, 5);
|
||
|
|
|
||
|
|
// Print answer
|
||
|
|
printf("Name:%s\n", dude.name);
|
||
|
|
printf("ID:%s\n", dude.id);
|
||
|
|
|
||
|
|
printf("Score:");
|
||
|
|
for (int i = 0; i < 4; i++) {
|
||
|
|
printf("%d ", dude.scores[i]);
|
||
|
|
}
|
||
|
|
printf("%d\n", dude.scores[4]);
|
||
|
|
|
||
|
|
printf("average:%.2f total:%d\n", dude.avg, dude.sum);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
void sort(int *arr, int n) {
|
||
|
|
int tmp;
|
||
|
|
for (int i = 0; i < n; i++) {
|
||
|
|
for (int j = 0; j < n - 1; j++) {
|
||
|
|
if(arr[j] < arr[j + 1]) {
|
||
|
|
tmp = arr[j];
|
||
|
|
arr[j] = arr[j + 1];
|
||
|
|
arr[j + 1] = tmp;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|