1、 #include<stdio.h> struct student{char namejzdxtz101];int time;};struct student mjzdxtz1000000],t,k;void quicksort(int left,int right) { int i,j,temp; if(left>right) return; k=mjzdxtzleft]; temp=mjzdxtzleft].time; i=left; j=right; while(i!=j) { while(mjzdxtzj].time>=temp&&i<j) j--; while(mjzdxtzi].time<=temp&&i<j) i++; if(i<j) { t=mjzdxtzj]; mjzdxtzj]=mjzdxtzi]; mjzdxtzi]=t; } } mjzdxtzleft]=mjzdxtzi]; mjzdxtzi]=k; quicksort(left,i-1); quicksort(i+1,right);} int main(){ int k,n; scanf("%d",&n);int i,j,t;for(i=1;i<=n;i++){scanf("%s %d",mjzdxtzi].name,&mjzdxtzi].time);}quicksort(1,n);for(i=1;i<n;i++){printf("%s ",mjzdxtzi].name);}printf("%s",mjzdxtzn].name);return 0;} 2、 #include<stdio.h>int main(){ if(2>1) printf("Win"); return 0;} 3、 #include<stdio.h>int main(){ long int a,i;scanf("%ld",&a);for(i=1;i*i<=a;i++){printf("%ld ",i*i);} return 0;} 4、 #include <stdio.h>#include <stdlib.h>struct Item{ int start; int end;};int cmp(const void *p1, const void *p2);int main(void){ int N, lastEnd; int count = 1; struct Item *items; scanf("%d", &N); items = (struct Item *)malloc(sizeof(struct Item) * N); for (int i = 0; i < N; i++) { scanf("%d %d", &itemsjzdxtzi].start, &itemsjzdxtzi].end); } qsort(items, N, sizeof(struct Item), cmp); lastEnd = items->end; for (int i = 1; i < N; i++) { if (itemsjzdxtzi].start >= lastEnd) { count++; lastEnd = itemsjzdxtzi].end; } } printf("%dn", count); return 0;}int cmp(const void *p1, const void *p2){ return ((struct Item *)p1)->end - ((struct Item *)p2)->end;} 5、
#include<stdio.h>int main(){int n,i,j,s=0;scanf("%d",&n);int ajzdxtzn+1];for(i=1;i<=n;i++){scanf("%d",&ajzdxtzi]);}for(i=1;i<=n;i++){ s=0;for(j=1;j<=n;j++){if(ajzdxtzi]==ajzdxtzj]){s++;}}if(s%2!=0){printf("%d",ajzdxtzi]);break;}}return 0;}