
#include<stdio.h>
int main() {
int a[3][3] = { {1,2,3},{4,5,6},{7,8,9} };
int sum = 0;
int i;
for (i = 0; i < 3; i++) {
sum += a[i][i];
}
printf("%d", sum);
return 0;
}


#include<stdio.h>
int main() {
int a[11] = { 1,4,6,8,10,18,19,28,40,100 };
int newnum;
int pos = 10;
scanf_s("%d", &newnum);
int newpos=0;
while (newpos<pos && newnum>a[newpos]) {
newpos++;
}
int i;
for (i = pos; i > newpos; i--) {
a[i] = a[i - 1];
}
a[newpos] = newnum;
pos++;
for (i = 0; i < pos; i++) {
printf("%d ", a[i]);
}
return 0;
}


#include<stdio.h>
int main() {
int a[5];
int i;
for (i = 0; i < 5; i++) {
scanf_s("%d", &a[i]);
}
for (i = 5 - 1; i >= 0; i--) {
printf("%d ", a[i]);
}
return 0;
}


#include <stdio.h>
int main() {
int i;
int j;
int count = 0;
int unique;
int a[10];
for (i = 0; i < 10; i++) {
scanf_s("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
unique = 1;
for (j = 0; j < i; j++) {
if (a[i] == a[j]) {
unique = 0;
break;
}
}
if (unique == 1) {
count++;
}
}
printf("%d", count);
return 0;
}


#include<stdio.h>
int main() {
int i, j;
int a[10];
int again;
for (i = 0; i < 10; i++) {
scanf_s("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
again = 0;
for (j = 0; j < i; j++) {
if (a[i] == a[j]) {
again = 1;
}
}
if (again == 0) {
printf("%d ", a[i]);
}
}
return 0;
}


#include<stdio.h>
#include<stdlib.h>
int compare(const void* a, const void* b) {
int* pa = (int*)a;
int* pb = (int*)b;
int num1 = *pa;
int num2 = *pb;
return num2 - num1;
}
int main() {
int score[10] = { 92,78,85,63,96,71,88,59,90,62 };
int k;
printf("请输入要找前几高的分数(1-10):");
scanf_s("%d", &k);
qsort(score, 10, sizeof(int), compare);
printf("前%d高的分数分别是:", k);
for (int i = 0; i < k; i++) {
printf("%d", score[i]);
if (i < k - 1) {
printf(",");
}
}
printf("分!");
return 0;
}
