NOJ西工大C程序设计实验题库Word文档格式.docx
《NOJ西工大C程序设计实验题库Word文档格式.docx》由会员分享,可在线阅读,更多相关《NOJ西工大C程序设计实验题库Word文档格式.docx(121页珍藏版)》请在冰豆网上搜索。
B)
m=A;
elsem=B;
if(m<
C)m=C;
m);
}
5找幸运数
intn;
scanf("
%d"
n);
if(n<
10)printf("
yes\n"
);
elseif((n<
100)&
&
(n%10==n/10))printf("
1000)&
(n%10==n/100))printf("
10000)&
(n/1000==n%10)&
(n/10%10==n/100%10))printf("
100000)&
(n%10==n/10000)&
(n/10%10==n/1000%10))printf("
elseprintf("
no\n"
return0;
6奖金发放
doublea,b;
%lf"
a);
if(a>
10)
if(a>
20)
40)
60)
100)
{b=+(a-100)*;
else
b=+(a-60)*;
else
b=+(a-40)*;
}
b=+(a-20)*;
b=1+(a-10)*;
b=a*;
%.6lf"
b);
7出租车费
if(a<
=2)b=7;
elseif(a<
=15)
if(a==(int)a)b=7+*(a-2);
elseb=7+((int)(a-2)+1)*;
elseif(a>
15)
if(a==(int)a)b=+*(a-15);
elseb=+((int)(a-15)+1)*;
%.6lf\n"
8是该年的第几天
inty,m,d,days,sum;
%d-%d-%d"
y,&
m,&
d);
if((y%4==0&
y%100!
=0)||(y%400))days=29;
elsedays=28;
switch(m)
case1:
sum=d;
break;
case2:
sum=31+d;
case3:
sum=31+days+d;
case4:
sum=62+days+d;
case5:
sum=92+days+d;
case6:
sum=123+days+d;
case7:
sum=153+days+d;
case8:
sum=184+days+d;
case9:
sum=215+days+d;
case10:
sum=245+days+d;
case11:
sum=276+days+d;
case12:
sum=306+days+d;
9成绩转换
ints;
s);
if(s>
=90)printf("
A\n"
elseif(s>
=80)printf("
B\n"
=70)printf("
C\n"
=60)printf("
D\n"
elseprintf("
E\n"
10求建筑高度
doublex,y;
%lf,%lf"
x,&
y);
if((x-2)*(x-2)+(y-2)*(y-2)<
=1)
10"
elseif((x+2)*(x+2)+(y-2)*(y-2)<
elseif((x+2)*(x+2)+(y+2)*(y+2)<
elseif((x-2)*(x-2)+(y+2)*(y+2)<
0"
11多项式的猜想
intx=1,y=1,n=2,sum=2,t;
while(sum<
=100){
t=x;
x=y;
y=t+2*y;
sum=sum+y;
n++;
printf("
n-1);
while(sum<
=1000){
t=x;
x=y;
y=t+2*y;
sum=sum+y;
n++;
=10000){
12整数位数
doublea=0;
inti=0,b=0;
b=(int)a;
for(;
(int)(b/pow(10,i));
)
i++;
i);
13五猴分桃
inti=1,a=0,b=0,c=1016,k=1;
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;
};
14你会存钱吗
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=2000*pow(1+*12*8,a)*pow(1+*12*5,b)*pow(1+*12*3,c)*pow(1+*12*2,d)*pow(1+*12,e);
if(f<
m){
f=m;
x=a,y=b,z=c,u=d,v=e;
};
};
%d%d%d%d%d\n%.2lf\n"
x,y,z,u,v,f);
15奇特的分数数列
doublea=1,b=2,i=1,m=0;
=20;
m+=b/a;
b=a+b;
a=b-a;
16区间内素数
inta,b,i,j,cnt=0,sum=0;
b=-1;
for(i=500;
=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;
cnt,sum);
17完全数
{inta,i,n;
for(a=6;
=1000;
a++)
{n=0;
for(i=1;
a;
if(a%i==0)n=n+i;
if(n==a)
{printf("
%d="
a);
for(i=1;
{
if(a%i==0)
{
if(i<
a/2)printf("
%d+"
elseprintf("
}
}
printf("
\n"
18级数和
intn,x,y;
doublesum=0,i;
scanf("
for(i=1;
=n;
x=pow((-1),i);
y=pow(2,i);
sum=sum-(x*y*/((x+y)*(2*y-x));
19两个整数之间的所有素数
inta,b,c,i,j,m;
if(a>
b)
c=b;
b=a;
for(i=a;
=b;
if(i==2)
2"
for(j=2;
m=i%j;
if(m==0)
gotoE;
%d"
E:
continue;
大学乒乓球比赛
int
main()
char
i,j,k;
for(i='
X'
;
='
Z'
for(j='
if(i!
=j)
for(k='
k<
k++)
=k&
j!
=k)
if((k!
)&
(k!
(i!
))
A=%c\nB=%c\nC=%c\n"
i,j,k);
return
0;
}
附加:
最次方数
intx=0,a=0,c=0,i=1;
c=x;
c=(c*x)%1000;
if(c<
100){
if(c<
00%d\n"
c);
else
0%d\n"
if(c>
=100)
自然立方的乐趣
inta=0,b=0,c=0;
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;
n<
n++){
+%d"
b-a/2*2+2*n);
if(a%2==0)
a,a,a,c,b+1-a);
b+1-a+n*2);
二分求根
doublea=0,b=0,c=0,e=0;
b-a>
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;
a=(a+b)/2;
%.2lf\n"
迭代求根
doublex1,x2,x3=0,a;
x1=a;
while(fabs(x1-x3)>
x2=(x1+a/x1)/2;
x3=x1;
x1=x2;
%.5lf\n"
x1);
计算pai
{inti;
doublea=1,sum=0;
1/a>
=;
{
if(i%2==0)sum=sum-1/a;
elsesum=sum+1/a;
a=a+2;
sum=sum*4;
21排列
i=0,j=0,k=0,a=0,b=0,c=0,l=0,m=0,n=0,d=0,p=0,q=0;
=3;
for(j=1;
=9;
for(k=1;
if(k!
=j&
i!
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!
n!
d!
p!
q!
=l&
=m&
=n&
k!
=n)
=d&
=p&
=q&
=q)
l!
%d
a,b,c);
}
22羊羊聚会
intx,y,a,b,l,s1,s2,t;
%d%d%d%d%d"
b,&
l);
if(x<
y){
s1=(y-x);
s2=l-s1;
b){t=s1/(a-b);
t);
b){t=s2/(b-a);
impossible\n"
else{
s1=x-y;
if(a>
b){t=s2/(a-b);
elseif(a<
b){t=s1/(b-a);
23粒子裂变
{inta=1,b1=0,b2,t,n;
t);
for(n=1;
=t;
n++)
{b2=2*b1+3*a;
a=b1;
b1=b2;
a,b2);
24“1”的传奇
iostream>
cstdio>
usingnamespacestd;
intfunction(intn)
{
intfactor=1;
intres=0;
intlow,cur,high;
while(n/factor)
low=n%factor;
cur=n/factor%10;
high=n/factor/10;
if(cur==0)
res+=high*factor;
elseif(cur==1)
res+=high*factor+low+1;
res+=(high+1)*factor;
factor*=10;
returnres;
intmain()
longn;
if(n>
=1&
=00)
%ld\n"
function(n));
25探索合数世纪
{intn,s,i=0,j=0,w,h=0,k,u=0;
{for(k=u;
{for(s=k*100,h=1;
s<
=k*100+99;
s++)
{for(j=2,w=1;
=sqrt(s);
{w=s%j;
if(w==0)break;
if(w!
=0){h=0;
if(h==1){u=k+1;
u=u-1;
%d00%d99\n"
u,u);
26幸运数字7
intN,i;
N);
=N;
if(N>
=10000)
if(i%10==7||i%7==0||i/10%10==7||i/100%10==7||i/1000%10==7)
=1000)
{
if(i%10==7||i%7==0||i/10%10==7||i/100%10==7)