2023年12月29日发(作者：)

#includeint main(int argc,char** argv){ int hour,min; scanf("%d:%d",&hour,&min); if(hour<12) printf("%d:%d AMn",hour,min); else if(hour==12) printf("12:%d PMn",min); else printf("%d:%d PMn",hour-12,min); return 0;}7-8#includeint main(int argc,char** argv){ int speed; scanf("%d",&speed); if(speed>60) printf("Speed: %d - Speedingn",speed); else printf("Speed: %d - OKn",speed); return 0;}7-9#includeint main(int argc,char** argv){ int A,B,C; scanf("%d %d %d",&A,&B,&C); if(A==B) printf("Cn"); else if(B==C) printf("An"); else printf("Bn"); return 0;}7-10

#includeint main(int argc,char** argv){ int year,week; scanf("%d %d",&year,&week); int k=year<5?30:50; float sum=k*(week>40?40:week); sum+=(week>40?(week-40)*1.5*k:0); printf("%.2fn",sum); return 0;}7-11#includeint main(int argc,char** argv){ float x; scanf("%f",&x); float y=(x<=15?x*4/3:2.5*x-17.5); printf("%.2fn",y); return 0;}7-12#includeint main(int argc,char** argv){ int num1,num2; char sf; scanf("%d %c %d",&num1,&sf,&num2); int result; if(sf=='+') result=num1+num2; else if(sf=='-') result=num1-num2; else if(sf=='*') result=num1*num2; else if(sf=='/') result=num1/num2; else if(sf=='%') result=num1%num2; else { printf("ERRORn"); return 0; } printf("%dn",result); return 0;}7-13

#includeint main(int argc,char** argv){ int N; scanf("%d",&N); int i; for(i=1;i<=N;i++) { int j; for(j=1;j<=i;j++) printf("%d*%d=%-4d",j,i,i*j); printf("n"); } return 0;}7-21#include#includeint main(int argc,char** argv){ int N; scanf("%d",&N); int x=N/2,k=0; double i,j; for(i=1;i<=sqrt(x);i++) for(j=i;j

putchar('a'); } putchar(M/100+'a'); putchar('B'); M%=100; fk1=0; fk2=1; } if(M/10) { if(fk1||fk3) { fk1=fk3=0; putchar('a'); } putchar(M/10+'a'); putchar('S'); M%=10; fk2=0; } if(M) { if(fk1||fk2||fk3) { fk3=0; putchar('a'); } putchar(M+'a'); } putchar('W'); fk1=fk2=0,fk4=1; } if(N/1000) { if(fk3) { fk3=0; putchar('a'); } putchar(N/1000+'a'); putchar('Q'); N%=1000; fk1=1; fk4=0; } if(N/100) { if(fk3||fk4) { fk3=fk4=0; putchar('a'); } putchar(N/100+'a'); putchar('B'); N%=100; fk1=0; fk2=1; } if(N/10) { if(fk1||fk3||fk4) { fk1=fk3=fk4=0; putchar('a'); } fk2=0;

#includeint main(int argc,char** argv){ char ch; int chlen=0,first=0; while(scanf("%c",&ch),ch!='.') { if(ch!=' ') chlen++; else if(chlen) { if(!first) { printf("%d",chlen); first=1; } else printf(" %d",chlen); chlen=0; } } if(chlen) { if(!first) printf("%d",chlen); else printf(" %d",chlen); } return 0;}>>不是空格或点就计数，遇到空格或点就输出当前计数并清零。7-27#includeint main(int argc,char** argv){ int N,K; scanf("%d%d",&N,&K); int i,j,dig[105]; for(i=1;i<=N;i++) scanf("%d",&dig[i]); for(i=0;idig[j+1]) { dig[j+1]+=dig[j]; dig[j]=dig[j+1]-dig[j]; dig[j+1]-=dig[j]; } for(i=1;i<=N;i++) printf("%d%c",dig[i],i==N?'n':' ');

return 0;}>>标准冒泡排序，调整排序次数为 K 次。7-28