c语言源代码Word文档下载推荐.docx
《c语言源代码Word文档下载推荐.docx》由会员分享,可在线阅读,更多相关《c语言源代码Word文档下载推荐.docx(29页珍藏版)》请在冰豆网上搜索。
![c语言源代码Word文档下载推荐.docx](https://file1.bdocx.com/fileroot1/2023-1/3/5f6408bb-677a-4964-ac02-c23ed376f231/5f6408bb-677a-4964-ac02-c23ed376f2311.gif)
elseif(n==2)printf("
Feb\n"
elseif(n==3)printf("
Mar\n"
elseif(n==4)printf("
Apr\n"
elseif(n==5)printf("
May\n"
elseif(n==6)printf("
June\n"
elseif(n==7)printf("
July\n"
elseif(n==8)printf("
Aug\n"
elseif(n==9)printf("
Sep\n"
elseif(n==10)printf("
Oct\n"
elseif(n==11)printf("
Nov\n"
elseprintf("
Dec\n"
}return0;
#include"
stdio.h"
math.h"
intmain()1019整数解
{intm,n;
Yes”或者“No
%d%d"
m,&
n)&
(m!
=0||n!
=0))
{if(-10000<
10000&
-10000<
m<
10000)
{intsign=0,flag=0;
if(n<
0){sign=1;
n=-n;
inti;
intj=sqrt(n);
if(n==0)flag=1;
for(i=1;
=j;
{intx=i;
inty=n/i;
if(x*y==n){
if(sign){
if(-x+y==m||x-y==m)
{flag=1;
break;
}
}else
{if(x+y==m||-(x+y)==m)
}}}
if(flag)break;
if(flag)printf("
Yes\n"
elseprintf("
No\n"
}return0;
intmain()1046一年中的
{intd,m,y,s,n;
第几天
%d%d%d"
y,&
d)!
{switch(m)
{case1:
s=0;
break;
case2:
s=31;
case3:
s=59;
case4:
s=90;
case5:
s=120;
case6:
s=151;
case7:
s=181;
case8:
s=212;
case9:
s=243;
case10:
s=273;
case11:
s=304;
case12:
s=334;
}s=s+d;
if(y%400==0||(y%4==0&
y%100!
=0))
n=1;
elsen=0;
if(n==1&
m>
2)
s++;
s);
}return0;
intmain()1047 成绩转换
{inta;
while((scanf("
a))!
{if(a>
=90&
a<
=100)
A\n"
if(a>
=80&
90)
B\n"
=70&
80)
C\n"
=60&
70)
D\n"
=0&
60)
E\n"
}}
intmain() 鸡兔同笼
{intnCase,i,nf;
1081
nCase)!
{for(i=0;
nCase;
{scanf("
nf);
if(nf%2!
=0)printf("
00\n"
elseif(nf%4!
=0)
%d%d\n"
nf/4+1,nf/2);
elseprintf("
nf/4,nf/2);
}}}
#include<
intmain() 1011幸运
{inti,N,n;
数
N)&
N!
{if(N==0)return0;
else{n=0;
for(i=1;
=N;
{n++;
while(n%3!
=0&
n%5!
{if(n%3==0)n=n;
elseif(n%5==0)n=n;
elsen++;
}}
n);
}}}
1077
intmain() 求N个数字的最大最
{intx,max=1,min=1,n,t;
小值
(n!
while(n--){scanf("
x);
if(x>
=max){t=max;
max=x;
x=t;
if(x<
=min){t=min;
min=x;
max,min);
math.h>
intmain()1045有趣的数字
{inti,x,y,N;
N)!
for(i=1;
{x=sqrt(i+100);
y=sqrt(i+268);
if(x*x==i+100&
y*y==i+268)
i);
return0;
intmain() 1093素数
{intX,N;
N);
while(N--){inti,f=1;
X);
if(X==1)
else
{for(i=2;
=sqrt(X);
{if(X%i==0)f=0;
if(f==1)printf("
}}return0;
1082
完全平方数
intmain()
{intn,N,m;
while(N--){
m);
n=sqrt(m);
if(n*n==m)printf("
1084
intmain() 找硬币
{intn,a,b,c,d;
{a=n/25;
b=(n-25*a)/10;
c=(n-25*a-10*b)/5;
d=(n-25*a-10*b-c*5);
a+b+c+d);
intmain() 1064
{intm,n,x,i;
折线分割平面
m)!
for(i=0;
m;
{scanf("
x=2*n*n-n+1;
x);
}return0;
voidrev(int*p1,int*p2);
voidmain() 1087比大小
{intn1,n2,n3,n;
int*p1=&
n1,*p2=&
n2,*p3=&
n3;
while(n--){
n1,&
n2,&
n3);
if(n1>
n2)rev(p1,p2);
n3)rev(p1,p3);
if(n2>
n3)rev(p2,p3);
%d%d%d\n"
n1,n2,n3);
voidrev(int*p1,int*p2)
{intp;
p=*p1;
*p1=*p2;
*p2=p;
intmain() 1095分数序列
{intm,n;
inti=2,j=1,t;
floatsum=0;
while(m--)
while(n--)
{sum+=(float)i/(float)j;
t=i;
i=i+j;
j=t;
}printf("
%.2f\n"
i=2,j=1;
1086
intmain() 字符串比大小
{chara[10],b[10];
intN,i,j;
for(i=0;
N;
%s"
a);
b);
for(j=0;
10;
{if(a[j]>
b[j])
{printf("
MING\n"
}elseif(a[j]<
{
GONG\n"
}}if(j==10)
SAME\n"
}}}
intmain()1021人见人爱A+B
{intah,am,as,bh,bm,bs;
intn;
scanf("
while(n--){
scanf("
%d%d%d%d%d%d"
ah,&
am,&
as,&
bh,&
bm,&
bs);
if(as+bs>
=60)
{as=as+bs-60;
am++;
}elseas=as+bs;
if(am+bm>
{am=am+bm-60;
ah++;
}else
am=am+bm;
ah=ah+bh;
printf("
ah,am,as);
计算书费1069
intmain(){inti,j,k,t;
floata[10];
floatsum[100];
a[1]=28.9;
a[2]=32.7;
a[3]=45.6;
a[4]=78;
a[5]=35;
a[6]=86.2;
a[7]=27.8;
a[8]=43;
a[9]=56;
a[10]=65;
while(scanf("
k)!
{for(i=1;
=k;
i++){
sum[i]=0;
for(j=1;
=10;
j++){
sum[i]=sum[i]+t*a[j];
sum[i]);
intmain() 1105数字交换
{intN,i,t,p,j,min,max;
inta[80];
getchar();
while(N--)
{i=0;
a[i++]);
while(getchar()=='
'
)
{scanf("
}t=0;
max=a[0];
i;
{if(a[j]>
max)
{max=a[j];
t=j;
a[t]=a[0];
a[0]=max;
p=0;
min=a[0];
j++){
if(a[j]<
min){
min=a[j];
p=j;
}a[p]=a[j-1];
a[j-1]=min;
i-1;
%d"
a[j]);
}printf("
a[i-1]);
intmain() 1106报数
{inti,k,m,n,num[50],*p;
{if(n==0)return0;
{p=num;
n;
*(p+i)=i+1;
i=0;
k=0;
m=0;
}while(m<
n-1)
{if(*(p+i)!
=0)k++;
if(k==3){*(p+i)=0;
k=0;
m++;
}i++;
if(i==n)i=0;
while(*p==0)p++;
*p);
intmain() 1114找零
{intn,i,m,c;
c=0;
while(m){c=c+m/10;
m=m%10;
c=c+m/5;
m=m%5;
c=c+m/2;
m=m%2;
c=c+m;
m=m%1;
c);
intmain() 1117比大小
{intx,y,z,t,n,i;
if(n<
100)
{for(i=1;
i++){
x,&
z);
=y){t=x;
x=y;
y=t;
=z){t=x;
x=z;
z=t;
}if(y>
=z){t=y;
y=z;
z=t;
}printf("
x,y,z);
intmain()1020Howmanydays
{intM,k;
M,&
(M!
=0||k!
{inttian=0;
while(M!
{M--;
tian++;
if(tian%k==0)M++;
tian);
intmain() 1058
{intn,t,sum,i,N;
{while(scanf("
{sum=0;
sum+=t;
}}}
intmain() 1057
{intn,sum,t;
=EOF&
n)
while(n--)
}
return0;
intmain() 1078数列
{intt1,t2,t3,a,b,n,i;
while(scanf("
%d%d%d"
a,&
b,&
(a!
=0||b!
{t3=t1=t2=1;
for(i=3;
t3=(a*t2+b*t1)%7;
t1=t2;
t2=t3;
t3);
}}
main() 1128
{intn,i;
股票助剂码
{chars[81];
intj,k=1;
gets(s);
s[0]=s[0]-32;
s[j]!
='
\0'
;
{if(s[j]=='
{s[k]=s[j+1]-32;
k++;
s[k]='
puts(s);
main()硬币组合
{intt;
1126
while(t--){
intn,m;
%d%d"
n,&
n*m-n-m+1);
string.h"
intmain()1090星期几
{char*name[]={"
"
"
MONDAY"
TUESDAY"
WEDNESDAY"
THURSDAY"
FRIDAY"
SATURDAY"
SUNDAY"
};
charday[10];
while(gets(day)){
8;
if(strcmp(day,name[i])==0)
{printf("
main() {inta,b,c,id=1;
while(scanf("
a)&
a)
c);
a=a*2;
if(a*a>
=b*b+c*c)
Pizza%dfitsonthetable.\n"
id++);
else
Pizza%ddoesnotfitonthetable.\n"
1112Alfredo'
sPizzaRestaurant
intcow(intn)1018母牛的{int 故事cow1=2,cow2=3,cow3=4,cow,i;
if(n<
1)return0;
elseif(n<
=4)returnn;
for(i=4;
{cow=cow3+cow1;
cow1=cow2;
cow2=cow3;
cow3=cow;
}returncow;
{intn,sum;
n){sum=0;
sum=sum+cow(n);
(评成绩等级)
分数序列累加
{10000(评成绩等级)
inta;
=EOF)
=100)printf("
90)printf("
80)printf("
70)printf("
60)printf("
}}
个人所得税)
递增牛群
{intn,y;
(递增牛群)
longf1,f2,f3,f;
{for(y=1;
y<
y++)
{if(y<
=3)f=f1=f2=f3=1;
else{f=f1+f3;
f1=f2;
f2=f3;
f3=f;
}
f);
}}
发电报的费用
数字游戏
{(发电报的费用)
chara[100];
intn,m,i,count;
floatmoney;
gets(a);
count=strlen(a);
if(n==0)
{if(count<
=10)
money=7.50;
money=0.75*count;
}else
money=0.75*2*(count+1)
money)}
{inti,n;
(分数序列累加)
floats,a,b,temp;
while(scanf("
{s=0;
a=1;
b=2;
for(i=1;
{s=s+b/a;
temp=a;
a=b