




版權(quán)說(shuō)明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)
文檔簡(jiǎn)介
一.1.第一季10題全(注:第五題問(wèn)題已經(jīng)解決,確認(rèn)AC!)#include
<stdio.h>
int
main()
{
int
a,b,sum;
scanf("%d%d",&a,&b);
sum=a+b;
printf("%d\n",sum);
return
0;
}2.#include
<stdio.h>
#define
PI
3.1415926
int
main(){
double
r,h,l,s,sq,vq,vz;
scanf("%lf%lf",&r,&h);
l=2*PI*r;
s=PI*r*r;
sq=4*PI*r*r;
vq=4*PI*r*r*r/3;
vz=s*h;
printf("%.2lf\n%.2lf\n%.2lf\n%.2lf\n%.2lf\n",l,s,sq,vq,vz);
return
0;
}3.#include
<stdio.h>
int
main(){
int
a,b,c;
double
d,e;
scanf("%d%d%d",&a,&b,&c);
d=a+b+c;
e=d/3;
printf("%lf\n%lf\n",d,e);
return
0;
}4.#include
<stdio.h>
int
main(){
int
a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a<b)
a=b;
if(a<c)
a=c;
printf("%d\n",a);
return
0;
}5.#include<stdio.h>
int
main()
{
int
i=0,j=0,k=1;
char
a[6];
while((a[i]=getchar())!='\n')
{
i++;
}
for(;i>0;i--){
if(a[j]==a[i-1]){
j++;
continue;}
else
{k=0;
break;}
}
if(k==1)
printf("yes\n");
else
printf("no\n");
}6.#include<stdio.h>
int
main()
{
double
a,c;
scanf("%lf",&a);
switch((int)a/10)
{
case
0:c=a*0.1;break;
case
1:c=(a-10)*0.075+10*0.1;break;
case
2:
case
3:c=(a-20)*0.05+10*0.075+10*0.1;break;
case
4:
case
5:c=(a-40)*0.03+20*0.05+10*0.075+10*0.1;break;
case
6:
case
7:
case
8:
case
9:c=(a-60)*0.015+20*0.03+20*0.05+10*0.075+10*0.1;break;
default:c=(a-100)*0.01+40*0.015+20*0.03+20*0.05+10*0.075+10*0.1;
}
printf("%lf\n",c);
return
0;
}
7.#include<stdio.h>
int
main()
{
double
a,b,c;
scanf("%lf",&a);
c=(int)a;
if(a>c)a=c+1;
if(a>15)
b=(a-15)*2.1+7+13*1.5;
else
{
if(a>2)
b=(a-2)*1.5+7;
else
b=7;
}
printf("%lf\n",b);
return
0;
}8.#include
<stdio.h>
int
main()
{
int
a,b,c,e,f=30,g=31,n;
scanf("%d-%d-%d",&a,&b,&c);
if((a%400==0)||(a%100!=0&&a%4==0))
e=29;
else
e=28;
switch
(b)
{
case
1:n=c;break;
case
2:n=g+c;break;
case
3:n=g+e+c;break;
case
4:n=g+e+g+c;break;
case
5:n=g+e+g+f+c;break;
case
6:n=g+e+g+f+g+c;break;
case
7:n=g+e+g+f+g+f+c;break;
case
8:n=g+e+g+f+g+f+g+c;break;
case
9:n=g+e+g+f+g+f+g+g+c;break;
case
10:n=g+e+g+f+g+f+g+g+f+c;break;
case
11:n=g+e+g+f+g+f+g+g+f+g+c;break;
default:
n=g+e+g+f+g+f+g+g+f+g+f+c;
}
printf("%d\n",n);
return
0;
}9.#include
<stdio.h>
int
main()
{
int
x;
scanf("%d",&x);
if(x>=90&&x<=100)
printf("A\n");
else
if
(x>=80)
printf("B\n");
else
if
(x>=70)
printf("C\n");
else
if
(x>=60)
printf("D\n");
else
printf("E\n");
return
0;
}10.#include<stdio.h>
int
main()
{
double
x,y,s;
scanf("%lf,%lf",&x,&y);
s=(x+2)*(x+2)+(y-2)*(y-2);
if(s>1){
s=(x+2)*(x+2)+(y+2)*(y+2);
if(s>1){
s=(x-2)*(x-2)+(y+2)*(y+2);
if(s>1){
s=(x-2)*(x-2)+(y-2)*(y-2);
if(s>1){printf("0\n");return
1;}
}
}
}
printf("10\n");
return
0;
}二。第二季15題全11.#include<stdio.h>intmain(){intx=0,a=0,c=0,i=1; scanf("%d%d",&x,&a); c=x;for(i=1;i<a;i++){ c=(c*x)%1000; }; if(c<100){ if(c<10) printf("00%d\n",c); else printf("0%d\n",c); }; if(c>=100) printf("%d\n",c); return0;}12.#include<stdio.h>intmain(){inti=1,a=0,b=0,c=1016,k=1;for(;k=1;){ c=c+4; a=c; b=c; for(i=1;i<=4;i++){ a=a/4*5+1; if(a%4!=0){ k=0; ;}; }; a=a/4*5+1; if(k==1){ printf("%d%d\n",a,b); break; }; }; return0;}13。。#include<stdio.h>#include<math.h>intmain(){ inti=1,n=0,b=0; doublej=0,k=0,m=0; scanf("%d",&n);for(;i<=n;i++){ b=i%2-1; k=pow(-1,b); m=pow(2,i); j+=k*m/(m-k)/(2*m+k); }; printf("%.6lf\n",j); return0;}14.#include<stdio.h>#include<math.h>intmain(){inta=0,b=0,i=0,t; scanf("%d%d",&a,&b);if(a>b){t=a;a=b;b=t;} for(;a<=b;a++) {intm=1; for(i=2;i<=sqrt(a);i++){ if(a%i==0){ m=0; break;}; }if(m==1) printf("%d",a); } printf("\n"); return0;}15.#include<stdio.h>#include<math.h>intmain(){inta=0,b=0,c=0; scanf("%d",&a);b=(int)pow(a,2); c=(int)pow(a,3); if(a%2) {printf("%d*%d*%d=%d=%d",a,a,a,c,b-a/2*2); intn=1; for(;n<a;n++){ printf("+%d",b-a/2*2+2*n); } printf("\n"); }; if(a%2==0) { intn=1; printf("%d*%d*%d=%d=%d",a,a,a,c,b+1-a); for(;n<a;n++){ printf("+%d",b+1-a+n*2); } printf("\n"); }; return0;}16#include<stdio.h>#include<math.h>intmain(){inta=0,b=0,c=0,d=0,e=0,x=0,y=0,z=0,u=0,v=0;doublef=0; for(a=0;a<=2;a++){ doublem=0; for(b=0;b<=(20-8*a)/5;b++){ for(c=0;c<=(20-8*a-5*b)/3;c++){ for(d=0;d<=(20-8*a-5*b-3*c)/2;d++){ e=20-8*a-5*b-3*c-2*d;m=2021*pow(1+0.0084*12*8,a)*pow(1+0.0075*12*5,b)*pow(1+0.0069*12*3,c)*pow(1+0.0066*12*2,d)*pow(1+0.0063*12,e); if(f<m){ f=m;x=a,y=b,z=c,u=d,v=e; }; }; }; }; }; printf("%d%d%d%d%d\n%.2lf\n",x,y,z,u,v,f); return0;}17.#include<stdio.h>#include<math.h>intmain(){doublea=0; inti=0,b=0; scanf("%lf",&a);b=(int)a; for(;(int)(b/pow(10,i));) i++;printf("%d\n",i); return0;}18。#include<stdio.h>intmain(){doublea=1,b=2,i=1,m=0; for(;i<=20;i++){ m+=b/a; b=a+b; a=b-a; } printf("%.6lf\n",m); return0;}19.#include<stdio.h>#include<math.h>intmain(){doublea=0,b=0,c=0,e=0; scanf("%lf%lf",&a,&b);for(;b-a>0.0001;){ c=2*pow(a,3)-4*pow(a,2)+3*a-6;e=2*pow((a+b)/2,3)-4*pow((a+b)/2,2)+3*(a+b)/2-6; if(c*e==0) { if(e==0) a=(a+b)/2; break; }; if(c*e!=0) { if(c*e<0) b=(a+b)/2; else a=(a+b)/2; }; }; printf("%.2lf\n",a); return0;}20.#include<stdio.h>
int
main()
{
char
i,j,k;
for(i='X';i<='Z';i++)
for(j='X';j<='Z';j++)
if(i!=j)
for(k='X';k<='Z';k++)
if(i!=k&&j!=k)
if((k!='X')&&(k!='Z')&&(i!='X'))
printf("A=%c\nB=%c\nC=%c\n",i,j,k);
return
0;
}21.#include<stdio.h>intmain(){ inta,b,i,j,cnt=0,sum=0; b=-1;for(i=500;i<=800;i++) { for(j=2;j<i;j++) { if(i%j==0) break; } if(j>i-1) { cnt++; a=b*i; sum+=a; b=-b; } } printf("%d%d\n",cnt,sum); return0;}22.#include<stdio.h>intmain(){ inti=2,A1=1,A2=1,A3,A4,n,M=10,j,S1=2,S2=0; for(n=1;n<=3;n++) { M=M*10; for(j=1;S1+A4<M||S2<=M;j++) { A3=A1+2*A2; A4=A2+2*A3; S1=S1+A3; S2=S1+A4; A1=A2; A2=A3; i++; } printf("%d\n",i); } return0;}23.#include<stdio.h>#include<math.h>intmain(){doublex1,x2,x3=0,a;scanf("%lf",&a);x1=a;while(fabs(x1-x3)>=0.00001){x2=(x1+a/x1)/2;x3=x1;x1=x2;}printf("%.5lf\n",x1);return0;}24.#include<stdio.h>intmain(){inti; doublea=1,sum=0; for(i=1;1/a>=0.000001;i++) { if(i%2==0)sum=sum-1/a; elsesum=sum+1/a; a=a+2; } sum=sum*4; printf("%.6lf\n",sum); return0;}25.#include<stdio.h>intmain(){inta,i,n; for(a=6;a<=1000;a++) {n=0; for(i=1;i<a;i++) { if(a%i==0)n=n+i; } if(n==a) {printf("%d=",a); for(i=1;i<a;i++) { if(a%i==0) { if(i<a/2)printf("%d+",i); elseprintf("%d",i); } } printf("\n"); } } return0;}三.第三季已齊全21.#include<stdio.h>#include<math.h>intmain(){ intx,y,a,b,l,s1,s2,t; scanf("%d%d%d%d%d",&x,&y,&a,&b,&l); if(x<y){ s1=(y-x);s2=l-s1;if(a>b){t=s1/(a-b); printf("%d\n",t);} elseif(a<b){t=s2/(b-a); printf("%d\n",t);} elseprintf("impossible\n");} else{ s1=x-y;s2=l-s1; if(a>b){t=s2/(a-b); printf("%d\n",t);} elseif(a<b){t=s1/(b-a); printf("%d\n",t);}elseprintf("impossible\n"); } return0;}22.#include<stdio.h>
#include<math.h>
int
main()
{
int
N,i,j,k,x,a,cnt=0;
scanf("%d",&N);
for(k=7;k<=N;k++)
{
j=k;
for(i=4;i>=0;i--)
{
a=(int)pow(10,i);
x=j/a;
if(x==7||k%7==0)
{
printf("%d
",k);
break;
}
else
j=j-a*x;
}
}
return
0;
}23.#include<stdio.h>intmain(){ inta,b,c,d,e,f,g,h,i,j,n; scanf("%d",&n); if(n<2||n>79)printf("error\n"); for(j=0;j<=9;j++) for(i=0;i<=9;i++)if(i==j)continue; elsefor(h=0;h<=9;h++)if(h==j||h==i)continue; elsefor(g=0;g<=9;g++)if(g==h||g==i||g==j)continue; elsefor(f=0;f<=9;f++)if(f==g||f==h||f==i||f==j)continue; elsefor(e=0;e<=9;e++)if(e==f||e==g||e==h||e==i||e==j)continue; elsefor(d=0;d<=9;d++)if(d==e||d==f||d==g||d==h||d==i||d==j)continue; elsefor(c=0;c<=9;c++)if(c==d||c==e||c==f||c==g||c==h||c==i||c==j)continue; elsefor(b=0;b<=9;b++)if(b==c||b==d||b==e||b==f||b==g||b==h||b==i||b==j)continue; elsefor(a=0;a<=9;a++)if(a==b||a==c||a==d||a==e||a==f||a==g||a==h||a==i||a==j)continue; elseif(double(a*10000+b*1000+c*100+d*10+e)/double(f*10000+g*1000+h*100+i*10+j)==n) printf("%d%d%d%d%d/%d%d%d%d%d=%d\n",a,b,c,d,e,f,g,h,i,j,n); elsecontinue; return0;} 24。#include<stdio.h>intmain(){inta=1,b1=0,b2,t,n;scanf("%d",&t);for(n=1;n<=t;n++){b2=2*b1+3*a;a=b1;b1=b2;}printf("%d%d\n",a,b2);return0;}25.#include<stdio.h>
#include<math.h>
int
main()
{
long
s=0,l=0,m=0;
int
n=0,i=0,j=0,k=0;
scanf("%d",&n);
for(s=14000;;s++)
{
for(i=1;i<=99;i+=2)
{
l=s*100+i;
for(m=3;m<=(int)pow(l,0.5);m+=2)
{
if(l%m==0)
{
goto
B;
}
}
goto
A;
B:
;}
k++;
if(n==k)
{
printf("%ld
%ld\n",s*100,l);
break;
}
A:
;}
return
0;
}26.#include<stdio.h>#include<math.h>intmain(){intm=0,n=0,g=0,s=0,i=0,k=0,j=0; scanf("%d%d",&m,&n); for(i=(int)pow(10,n-1);i<(int)pow(10,n);i++){ j=i; for(k=1;k<=n;k++){if(j%10==m){ if(i%m){ g++; s+=i; }; k=n; }; j/=10; }; }; printf("%d%d\n",g,s); return0;}27.#include<stdio.h>
int
main()
{
int
a=0,b=0,j=0;
double
i=0,s=0,k=0;
scanf("%d%d",&a,&b);
for(i=1;s<b;i++){
k+=1/i;
s+=1/k;
if(s>a)
j++;
if(j==1)
printf("%d
",(int)i);
if(s>b)
printf("%d\n",(int)(i-1));
};
return
0;
}28.#include<stdio.h>intmain(){intk=0; scanf("%d",&k); doublex=0,y=0;for(y=k+1;y<=k*2;y++){ for(x=y;1/x+1/y>=1/(double)k;x++){ if(1/(double)k==1/x+1/y){ printf("1/%d=1/%g+1/%g\n",(int)k,x,y); }; }; }; return0;}29.#include<stdio.h>#include<math.h>intmain(){intn=0,i=0,j=0,k=0,a=0,b=0,c=0,g=0; scanf("%d",&n); for(i=0;i<(int)pow(2,n);i++){ k=i;for(j=1;j<=n-2;j++){ a=k%2; b=(k/2)%2; c=(k/4)%2; k/=2; if(a&&b&&c){ g++; break; } } }; printf("%d\n",g); return0;}30.#include<stdio.h>intmain(){ intn=0,i=0,k=1,d=1,m=0; scanf("%d",&n);ints[20]; for(i=1;i<=n;i++){ scanf("%d",&s[i-1]); }; for(i=0;i<n-1;i++){ k=i; d=1; for(;k<n;k++){ d*=s[k];m=d>m?d:m; } } if(m>0) printf("%d\n",m); else printf("-1\n"); return0;}31#include<stdio.h>
int
main()
{
int
i=0,j=0,k=0,a=0,b=0,c=0,l=0,m=0,n=0,d=0,p=0,q=0;
for(i=1;i<=3;i++)
{
for(j=1;j<=9;j++)
{
if(i!=j)
{
for(k=1;k<=9;k++)
{
if(k!=j&&i!=k)
{
a=i*100+j*10+k;
b=a*2;
c=a*3;
l=b%10,d=c%10;
m=(b%100)/10,p=(c%100)/10;
n=b/100,q=c/100;
if(l!=0&&m!=0&&n!=0&&d!=0&&p!=0&&q!=0)
if(i!=l&&i!=m&&i!=n&&j!=l&&j!=m&&j!=n&&k!=l&&k!=m&&k!=n)
if(i!=d&&i!=p&&i!=q&&j!=d&&j!=p&&j!=q&&k!=d&&k!=p&&k!=q)
if(l!=d&&l!=p&&l!=q&&m!=d&&m!=p&&m!=q&&n!=d&&n!=p&&n!=q)
printf("%d
%d
%d\n",a,b,c);
}
}
}
}
}
return
0;
}32.#include<stdio.h>#include<math.h>intmain(){ intn,m,i; doubleb=0; scanf("%d%d",&n,&m); for(i=n;i<=m;i++) { b=b+1/pow(i,2.0); } printf("%.5lf\n",b); return0;}33.#include<stdio.h>intmain(){ intn,i,j,k,t; scanf("%d",&n); k=0; for(i=1;i<=n;i++) { t=i; while(t!=0) { j=t%10; t=t/10; if(j==1) k++; } } printf("%d\n",k); return0;}34.#include
<stdio.h>
int
main()
{
int
a,b,c,i;
scanf("%d
%d
%d",&a,&b,&c);
for(i=10;i<=100;i++)
if(i%3==a&&i%5==b&&i%7==c){
printf("%d\n",i);
break;
}
if(i>100)printf("-1\n");
return
0;
}35#include<stdio.h>#include<stdlib.h>intmain(){ inta,b,c,i,A[100]; scanf("%d%d%d",&a,&b,&c); A[0]=a/b; a=a%b; for(i=1;i<c+1;i++) { A[i]=a*10/b; a=a*10%b; } A[i]=a*10/b; if(A[c+1]>=5) { A[c]=A[c]+1; for(i=c;i>=0;i--) if(A[i]==10)A[i-1]+=1,A[i]=0;} printf("%d.",A[0]); for(i=1;i<=c;i++) printf("%d",A[i]); printf("\n"); return0;}四。第四季齊全31.#include<stdio.h>intgetfloor(doublea){ intb; if(a<int(a))b=int(a)-1; elseb=int(a); returnprintf("%d\n",b);}intmain(){ doublea; scanf("%lf",&a); getfloor(a); return0;}32.#include<stdio.h>intsum(intx){inti=0,s=0; for(i=1;i<x;i++) { if(x%i==0) { s+=i; } } returns;}intmain(){inta=0,b=0; scanf("%d%d",&a,&b);if(a==sum(b)&&b==sum(a)) { printf("YES\n"); } else { printf("NO\n"); } return0;}33.#include<stdio.h>intmove(intverge,intn){ inta=0; a=verge;if(n<0) {n=0-n;verge<<=n; a>>=(32-n); verge+=a; } else { verge>>=n; a<<=(32-n); verge+=a; } returnverge;}intmain(){unsignedverge=0; intn=0; scanf("%d%d",&verge,&n); printf("%d\n",move(verge,n)); return0;}34.#include<stdio.h>intmain(){ intn=0,i=1; doublea=0,b=0,c=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%lf",&c); a+=c*c; b+=c; } c=a-1.0/n*b*b; printf("%.6lf\n",c); return0;}35.#include<stdio.h>intC(intm,intn){inti=0,a=1,b=1; for(i=1;i<=m;i++) { a*=n; n--; b*=i; } returna/b;}intmain(){unsignedintm=0,n=0; scanf("%d%d",&n,&m); if(m>n){ printf("wrong\n"); } else { printf("%d\n",C(m,n)); } return0;}36.#include<stdio.h>intGZ(intn){inti=0; i=n/100; n%=100; i+=n/50;n=n%50; i+=n/10; n%=10;i+=n/5; n%=5; i+=n/2;i+=n%2; returni;}intmain(){ intn=0,i=1,x=0,k=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&x); k+=GZ(x); } printf("%d\n",k); return0;}37.#include<stdio.h>intmain(){intAH=0,AM=9,AS=0,BH=0,BM=0,BS=0; scanf("%d%d%d%d%d%d",&AH,&AM,&AS,&BH,&BM,&BS);if(AH>=0&&AM>=0&&AS>=0&&BH>=0&&BM>=0&&BS>=0&&AM<60&&AS<60&&BM<60&&BS<60) { AS+=BS; AM+=BM; AH+=BH; if(AS>59) { AM+=1; AS%=60; }if(AM>59) { AH+=1; AM%=60; } printf("%d%d%d\n",AH,AM,AS); } return0;}38.#include<stdio.h>voidDAO(unsignedlongn){ if(n<10) { printf("%d",n); } else { printf("%d",n%10); n/=10; DAO(n); }}intmain(){unsignedlongn=0; scanf("%d",&n); DAO(n); printf("\n"); return0;}39.#include<stdio.h>#include<math.h>intJM(intn){ inta=0,i=0; for(i=1;i<=4;i++) { a+=(n%10+5)%10*(int)pow(10,4-i); n/=10; } returna;}intmain(){ unsignedn=0; scanf("%d",&n); if(n>999&&n<10000) { printf("%d\n",JM(n)); } return0;}40.#include<stdio.h>inlineintxchg(unsignedcharn){return(n%16)*16+n/16;}intmain(){unsignedcharn=0; scanf("%d",&n); printf("%d\n",xchg(n)); return0;}41#include<stdio.h>#include<stdlib.h>intn;voidfun(intA[]){ inti,s; for(i=0;i<n*2;i+=2) { s=A[i]+A[i+1]; printf("%d\n",s%100); }}intmain(){intA[81],j;scanf("%d",&n);for(j=0;j<n*2;j++)scanf("%d",&A[j]);fun(A);return0;}42#include<stdio.h>
int
ack(int
m,int
n)
{
int
x;
if(m==0)
x=n+1;
else
if(n!=0)
x=ack((m-1),ack(m,n-1))
;
else
x=ack(m-1,1);
return
x;
}
int
main()
{
int
m,n;
scanf("%d%d",&m,&n);
printf("%d\n",ack(m,n));
return
0;
}43#include<stdio.h>
#include<math.h>
double
integral(double
a,double
b,double(*f)(double
x))
{
int
n=1000,i;
double
h,x,s=0.0;
h=(b-a)/n;
for(i=1;i<=n;i++)
{
x=a+(i-1)*h;
s=s+(f(x)+f(x+h))*h/2;
}
return
s;
}
double
f(double
x)
{
return
1/(1+x*x);
}
int
main()
{
double
a,b,t;
scanf("%lf
%lf",&a,&b);
t=integral(a,b,f);
printf("%lf\n",t);
return
0;
}44.#include<stdio.h>
#include<math.h>
int
getbit(int
n,int
k)
{
int
i,l,mid,q,j=1,s=0;
mid=n;
for(i=1;;i++)
{
l=mid%2;
s=s+l*j;
j=j*10;
mid=mid/2;
if(mid==0)
break;
}
q=s/pow(10,k-1);
q=q%10;
return
q;
}
int
main()
{
int
n,k;
scanf("%d
%d",&n,&k);
printf("%d\n",getbit(n,k));
return
0;
}45.#include<stdio.h>intfceil(doublex){ inta; a=x; a=a+1; returna;}intmain(){ doublex; scanf("%lf",&x); if(x<0)printf("%d\n",fceil(x)-1); elseprintf("%d\n",fceil(x)); return0;}五。第五季已齊41.#include<stdio.h>voidSelectionSort(intA[],ints,intm){inti=0,n=0; for(;s<=m;s++) { i=s; for(;i<=m;i++) { if(A[i]>A[s]) { n=A[s]; A[s]=A[i]; A[i]=n; } } }}intmain(){intA[100]={0},s=0,m=0,n=0,i=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&A[i]); } scanf("%d%d",&s,&m); SelectionSort(A,s,m); for(i=0;i<n;i++) { printf("%d",A[i]); } printf("\n"); return0;}42。#include<stdio.h>voidSelectionSort(intA[],ints,intm){inti=0,n=0,k=0; i=s; for(;m>0;m--) { i=s;for(;i<s+m-1;i++) { if(A[i]<A[i+1]) { k=A[i]; A[i]=A[i+1]; A[i+1]=k; } } }}intmain(){intA[100]={0},s=0,m=0,n=0,i=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&A[i]); } scanf("%d%d",&s,&m); SelectionSort(A,s,m); for(i=0;i<n;i++) { printf("%d",A[i]); } printf("\n"); return0;}43.#include<stdio.h>voidpaixu(intA[],intm){inti=1,n=0,j=0; for(;j<m;j++) { for(i=j+1;i<m;i++) { if(A[i]<A[j]) { n=A[j]; A[j]=A[i]; A[i]=n; } } }}intmain(){intn=0,m=0,A[100]={0},B[100]={0},i=0,j=0,k=0;scanf("%d%d",&n,&m); for(i=0;i<n;i++) { scanf("%d",&A[i]); } for(i=0;i<m;i++) { scanf("%d",&B[i]); } if(m<n) { printf("NULL\n"); } else { paixu(A,n); paixu(B,m); for(i=0;i<m;i++) { if(A[0]<=B[i]) { if(m-i>=n) { for(k=0;k<n;k++) { j+=B[i+k]; } printf("%d\n",j); } else { printf("NULL\n"); } break; } } } return0;}44.#include<stdio.h>voidSelectionSort(intA[],ints,intm){inti=0,j=0,k=0; for(i=s+1;i<s+m;i++) { j=i; while(A[j]>A[j-1]&&j-1>=s) {k=A[j]; A[j]=A[j-1];A[j-1]=k; j--; } }}intmain(){intA[100]={0},s=0,m=0,n=0,i=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&A[i]); } scanf("%d%d",&s,&m); SelectionSort(A,s,m); for(i=0;i<n;i++) { printf("%d",A[i]); } printf("\n"); return0;}45.#include<stdio.h>intmain(){ intA[100]={0},i=0,j=0,n=0,m=0; scanf("%d",&n);for(i=0;i<n;i++) { scanf("%d",&A[i]); } scanf("%d",&m); i=0;j=n-1;while(j-i>1) { if((A[i]-m)*(A[(j+i)/2]-m)<=0) { j=(i+j)/2; }else { i=(i+j)/2; } }if(A[i]==m||A[j]==m||A[(i+j)/2]==m){ printf("%d\n",A[i]==m?i:(A[j]==m?j:(i+j)/2));}else{printf("null\n");}return0;}46.#include<stdio.h>intmain(){intA[100],B[100],C[100],n=0,i=0; scanf("%d",&n); for(i=0;i<n&&n<=100;i++) { scanf("%d",&A[i]); } for(i=0;i<n&&n<=100;i++) { scanf("%d",&B[i]); } for(i=0;i<n&&n<=100;i++) { C[i]=A[i]+B[i]; printf("%d",C[i]); } printf("\n"); return0;}47.#include<stdio.h>
intmain()
{
intn,count=0,i,j,a[100],k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=1;i<n;i++)
{
k=a[i];
for(j=i-1;j>=0&&k<a[j];j--)
{
count++;
a[j+1]=a[j];
}
a[j+1]=k;
}
printf("%d\n",count);
return0;
}48.#include<stdio.h>#include<stdlib.h>intmain(){ intm,n,i,j,l,k,x,y,s2=0,s=0; scanf("%d%d",&m,&n); int*A; A=(int*)malloc(m*n*sizeof(int)); for(i=0;i<m;i++) for(j=0;j<n;j++) scanf("%d",A+i*n+j); for(l=0;l<m;l++) for(k=0;k<n;k++) s=s+A[l*n+k]; for(x=1;x<m-1;x++) for(y=1;y<n-1;y++) s2=s2+A[x*n+y]; s=s-2*s2; printf("%d\n",s); return0;}49.#include
<stdio.h>
void
QuickSort(int
A[100],int
s,int
m);
int
main()
{
int
A[100],n,s,m,i;
scanf("%d",&n);
for
(i=0;i<n;i++)
{
scanf("%d",&A[i]);
}
scanf("%d
%d",&s,&m);
QuickSort(A,s,m);
for(i=0;i<n;i++)
{
printf("%d
",A[i]);
}
printf("\n");
return
0;
}
void
QuickSort(int
A[100],int
s,int
m)
{
int
i,j,t;
if(s<m)
{
i=s;
j=m+1;
while(1)
{
while(i+1<s+m&&A[++i]>A[s]);
while(j-1>-1&&A[--j]<A[s]);
if(i>=j)
break;
t=A[i],A[i]=A[j],A[j]=t;
}
t=A[s],A[s]=A[j],A[j]=t;
QuickSort(A,s,j-1);
QuickSort(A,j+1,m);
}
}50#include<stdio.h>intmain(){ intA[100][100]; intn,i,j,x,y; scanf("%d",&n); for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&A[i][j]); for(x=0;x<n;x++) { for(y=0;y<n;y++) { if(y<n-x) { printf("%d",A[x][y]); } elseprintf(""); } printf("\n"); } return0;}51#include<stdio.h>#include<stdlib.h>intmain(){ intm,n,A[100][100],i,j; scanf("%d",&n); for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&A[i][j]); m=n; for(i=0;i<m;i++) { for(j=0;j<n-1;j++) printf(""); for(j=n-1;j<m;j++) printf("%d",A[i][j]); printf("\n"); n--; } return0;}52#include<stdio.h>intmain(){ intA[100],B[100]; intn,i,j,k; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&A[i]); } for(j=0;j<n;j++) { B[j]=A[j]; } for(k=1;k<n;k=k+2) { printf("%d",B[k]); } printf("\n"); return0;}53#include<stdio.h>intmain(){ intA[100][100]; intn,i,j,x,y; scanf("%d",&n); for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&A[i][j]); for(x=0;x<n;x++) { for(y=0;y<n;y++) { if(y>=x) { printf("%d",A[x][y]); } elseprintf(""); } printf("\n"); } return0;}54#include<stdio.h>doubleavg(intA[],ints,inte){ inti; doublem=0,n; for(i=s;i<s+e;i++) m=m+A[i]; n=m/(e-s+1); returnn;}intmain(){ intA[100],n,s,e,i; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&A[i]); scanf("%d%d",&s,&e); printf("%lf\n",avg(A,s,e)); return0;}55#include<stdio.h>#include<stdlib.h>intmain(){ intn,A[100][100],i,j; scanf("%d",&n); for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&A[i][j]); for(i=0;i<n;i++) { for(j=0;j<=i;j++) printf("%d",A[i][j]); printf("\n"); } return0;}第六季題已齊51.#include<stdio.h>inti=0,j=0,k=0,m=0,n=0;voidjishu(charA[]){intd=0; for(d=0;A[d]!='\0';d++) { if(A[d]>64&&A[d]<91) { i++; } else { if(A[d]>96&&A[d]<123) { j++; } else { if(A[d]>47&&A[d]<58) { k++; } else { if(A[d]=='') { m++; } else { n++; } } } } }}intmain(){charA[80],B[80],C[80]; gets(A),gets(B),gets(C);jishu(A);jishu(B);jishu(C);printf("%d%d%d%d%d\n",i,j,k,m,n); return0;}52.#include<stdio.h>intstringcompare(charS1[],charS2[]){inti=0;while(S1[i]==S2[i++]&&S1[i]!='\0'&&S2[i]!='\0');returnS1[i-1]-S2[i-1];}intmain(){charS1[100],S2[100]; gets(S1);gets(S2);printf("%d\n",stringcompare(S1,S2)); return0;}53.#include<stdio.h>voiddeletechar(charS[],charc){inti=0,j=0;for(j=0;S[j]!='\0';j++){if(S[j]!=c){S[i]=S[j];i++;}}S[i]='\0';}intmain(){charS[100],c;gets(S);scanf("%c",&c);deletechar(S,c);puts(S);return0;}54#include<stdio.h>inthe(charA[],inti){ intj,x=0; for(j=i;j<=3;j++) { if(A[j]=='I') { x=x+1; } elsebreak; } returnx;}intmain(){ charA[10]; gets(A); if(A[1]=='V') { printf("4\n"); } elseif(A[1]=='X') { printf("9\n"); } elseif(A[0]=='I') { printf("%d\n",he(A,0)); } elseif(A[0]=='V') { printf("%d\n",he(A,1)+5); } elseprintf("%d\n",he(A,1)+10); return0;}55.(此題運(yùn)行正確,但未得到批改后的AC確認(rèn))#include<stdio.h>#include<string.h>intmain(){ voidsortstr(chars[10][11],int); inti; chars[10][11]; for(i=0;i<10;i++) { scanf("%s",s[i]); } sortstr(s,10); for(i=0;i<10;i++) { if(i!=0) { printf(""); } printf("%s",s[i]); } printf("\n"); return0;}voidsortstr(chars[10][11],intn){ char*p,t[11]; inti,j; for(i=0;i<n-1;i++) { p=*(s+i); for(j=i+1;j<n;j++) { if(strcmp(p,*(s+j))>0) { p=*(s+j); } } if(p!=*(s+i)) { strcpy(t,*(s+i)); strcpy(*(s+i),p); strcpy(p,t); } }}56#include<stdio.h>#include<string.h>intmain(){ charA[100]; charl[100]; gets(A); intm,n,i,j; scanf("%d",&m); n=strlen(A); for(i=m;i<n;i++) { l[i]=A[i]; } for(j=m;j<n;j++) { printf("%c",l[j]); } printf("\n"); return0;}57#include<stdio.h>intmain(){inttest_case=0;charnote[1000];while(gets(note)!=NULL){test_case++;if(note[0]=='A'&¬e[1]==''){printf("UNIQUE\n");break;}elseif(note[0]=='A'&¬e[1]=='#'){note[0]='B';note[1]='b';printf("%s\n",note);break;}elseif(note[0]=='B'&¬e[1]=='b'){note[0]='A';note[1]='#';printf("%s\n",note);break;}elseif(note[0]=='B'&¬e[1]==''){printf("UNIQUE\n");break;}elseif(note[0]=='C'&¬e[1]==''){printf("UNIQUE\n");break;}elseif(note[0]=='C'&¬e[1]=='#'){note[0]='D';note[1]='b';printf("%s\n",note);break;}elseif(note[0]=='D'&¬e[1]=='b'){note[0]='C';note[1]='#';printf("%s\n",note);break;}elseif(note[0]=='D'&¬e[1]==''){printf("UNIQUE\n");break;}elseif(note[0]=='D'&¬e[1]=='#'){note[0]='E';note[1]='b';printf("%s\n",note);break;}elseif(note[0]=='E'&¬e[1]=='b'){note[0]='D';note[1]='#';printf("%s\n",note);break;}elseif(note[0]=='E'&¬e[1]==''){printf("UNIQUE\n");break;}elseif(note[0]=='F'&¬e[1]==''){printf("UNIQUE\n");break;}elseif(note[0]=='F'&¬e[1]=='#'){note[0]='G';note[1]='b';printf("%s\n",note);break;}elseif(note[0]=='G'&¬e[1]=='b'){note[0]='F';note[1]='#';printf("%s\n",note);break;}elseif(note[0]=='G'&¬e[1]==''){printf("UNIQUE\n");break;}elseif(note[0]=='G'&¬e[1]=='#'){note[0]='A';note[1]='b';printf("%s\n",note);break;}elseif(note[0]=='A'&¬e[1]=='b'){note[0]='G';note[1]='#';printf("%s\n",note);break;}else{printf("false");break;}}return0;}58.#include<stdio.h>#include<string.h>voidstringmerge(charS1[],charS2[]);intmain(){charS1[10000],S2[10000];gets(S1);gets(S2);stringmerge(S1,S2);puts(S1);return0;}voidstringmerge(charS1[],charS2[]){ S1=strcat(S1,S2);}59#include<stdio.h>#include<string.h>intmain(){ charA[100],B[100]; inti; gets(A); for(i=0;i<100;i++) { if(A[i]=='y'&&A[i+1]=='o'&&A[i+2]=='u') { A[i]='w'; A[i+1]='e'; A[i+2]=''; } }for(i=0;A[i]!='\0';i++) { if(A[i-2]=='w'&&A[i-1]=='e'&&A[i]=='') continue; elseprintf("%c",A[i]); } printf("\n"); return0;}60#include<stdio.h>#include<string.h>#include<math.h>intgcd(inta,intb){if(a==0){returnb;}elseif(b==0){returna;}else{inti=a>b?b:a;while(a%i!=0||b%i!=0){i--;}returni;}}intmain(){ inti,r=0,l=0,w=0,m=0;
溫馨提示
- 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
- 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。
最新文檔
- 杭州河道護(hù)坡施工方案
- 土方開(kāi)挖階段施工方案
- 水工程施工方案
- 平整小院地面施工方案
- 屋頂粉刷砂漿施工方案
- 水泵安裝施工方案
- TSHZJRXH 001-2024 石河子自助銀行建設(shè)規(guī)范
- 二零二五年度退房流程規(guī)范合同
- 二零二五年度未成年人特殊監(jiān)護(hù)協(xié)議書
- 二零二五年度鋼琴考級(jí)輔導(dǎo)班報(bào)名合同書
- 醫(yī)院設(shè)施日常巡查管理制度
- 2025年太倉(cāng)市文化旅游發(fā)展集團(tuán)限公司及子公司公開(kāi)招聘12名高頻重點(diǎn)提升(共500題)附帶答案詳解
- 機(jī)械制圖題庫(kù)及答案
- 安裝承包合同(2025年)
- 云上貴州大數(shù)據(jù)(集團(tuán))有限公司招聘筆試沖刺題2024
- 人教版四年級(jí)下冊(cè)數(shù)學(xué)第二單元觀察物體(二) 單元測(cè)試
- 建筑工程公司績(jī)效考核制度范本
- 保育員與教師協(xié)作配合的技巧與案例
- 2024-2030年中國(guó)實(shí)驗(yàn)室家具行業(yè)發(fā)展規(guī)劃及投資前景預(yù)測(cè)報(bào)告版
- 綠色金融案例分析
- 【MOOC】運(yùn)動(dòng)安全與健康-浙江大學(xué) 中國(guó)大學(xué)慕課MOOC答案
評(píng)論
0/150
提交評(píng)論