该楼层疑似违规已被系统折叠隐藏此楼查看此楼
实验三:摄氏温度与华氏温度的转换
#include
int main()
{
float celsius;
float fahrenheit;
printf("The fahrenheit is : ");
scanf("%f",&fahrenheit);
celsius=5.0/9.0*(fahrenheit-32.0);
printf("\nThe celsius is:%f",celsius);
return 0;
}
实验四:
1.三个数比较大小
#include
int main()
{
int a,b,c,max,min;
scanf("%d%d%d",&a,&b,&c);
if(a>b)
{
max=a;
min=b;
}
else
{
max=b;
min=a;
}
if(max>c)
printf("max=%d",max);
else
printf("max=%d",c);
if(min
printf("min=%d",min);
else
printf("min=%d",c);
方法二:
#include
int main()
{
int a,b,c,max,min;
scanf("%d%d%d",&a,&b,&c);
if(a>b) max=a,min=b;
elsemax=b,min=a;
if(c>max) max=c;
if(c
printf("max=%d",max);
printf("min=%d",min);
return 0;
}
2.
#include
int main()
{
float I,bonus;
printf("I= ");
scanf("%f",&I);
if(I>1000000) bonus=100000*0.1+100000*0.075+200000*0.05+200000*0.03+400000*0.015+(I-1000000) *0.01;
else if(I>600000) bonus=100000*0.1+100000*0.075+200000*0.05+200000*0.03+(I-600000)*0.015;
else if(I>400000) bonus=100000*0.1+100000*0.075+200000*0.05+(I-400000)*0.03;
else if(I>200000) bonus=100000*0.1+100000*0.075+(I-200000)*0.05;
else if(I>100000) bonus=100000*0.1+(I-100000)*0.075;
else bonus=I*0.1;
printf("bonus=%f",bonus);
return 0;
}
3.百马百担
#include
int main()
{
int m,n,k;
int sum=0;
printf("各种驮法如下:\n ");
for(m=1;m<=100/3;m++ )
for(n=1;n<100/2;n++)
{
k=100-m-n;
if((2*3*m+2*2*n+k)==2*100)
{
printf("大马%d匹; 中马%d匹; 小马%d匹.\n ",m,n,k);
sum++;
}
}
printf("共有%d种驮法. ",sum);
return 0;
}
实验五:
1,日期转换
#include
main()
{
int num,day,month,year;
printf("请输入年份:");
scanf("%d",&year);
printf("\n请输入月份:");
scanf("%d",&month);
printf("\n请输入日期:");
scanf("%d",&day);
if(year%4==0)
{
f=29;
if(year%100==0)
f=28;
}
else if(year%400==0)
f=29;
else
f=28;
if(month==1)
num=day;
else if(month==2)
num=31+day;
else if(month==3)
num=31+f+day;
else if(month==4)
num=31+f+31+day;
else if(month==5)
num=31+f+31+30+day;
else if(month==6)
num=31+f+31+30+31+day;
else if(month==7)
num=31+f+31+30+31+30+day;
else if(month==8)
num=31+f+31+30+31+30+31+day;
else if(month==9)
num=31+f+31+30+31+30+31+31+day;
else if(month==10)
num=31+f+31+30+31+30+31+31+30+day;
else if(month==11)
num=31+f+31+30+31+30+31+31+30+31+day;
else
num=31+f+31+30+31+30+31+31+30+31+30+day;
printf("结果是%d年的第%d天",year,num);
return 0;
}
2,
#include
main()
{
int num,day,month,year,f;
printf("请输入年份:");
scanf("%d",&year);
printf("请输入天数:");
scanf("%d",&num);
if(year%4==0)
{
f=29;
if(year%100==0)
f=28;
}
else if(year%400==0)
f=29;
else
f=28;
if(f==29)
{
if(num>335)
month=12,day=num-335;
else if(num>305)
month=11,day=num-305;
else if(num>274)
month=10,day=num-274;
else if(num>244)
month=9,day=num-244;
else if(num>213)
month=8,day=num-213;
else if(num>182)
month=7,day=num-182;
else if(num>152)
month=6,day=num-152;
else if(num>121)
month=5,day=num-121;
else if(num>91)
month=4,day=num-91;
else if(num>60)
month=3,day=num-60;
else if(num>31)
month=2,day=num-31;
else
month=1,day=num;
}
else
{
if(num>334)
month=12,day=num-334;
else if(num>304)
month=11,day=num-304;
else if(num>273)
month=10,day=num-273;
else if(num>243)
month=9,day=num-243;
else if(num>212)
month=8,day=num-212;
else if(num>181)
month=7,day=num-181;
else if(num>151)
month=6,day=num-151;
else if(num>120)
month=5,day=num-120;
else if(num>90)
month=4,day=num-90;
else if(num>59)
month=3,day=num-59;
else if(num>31)
month=2,day=num-31;
else
month=1,day=num;
}
printf("结果是%d年%d月%d日",year,month,day);
return 0;
}
3,(1)迭代法:iteration
#include
int X(int);
int main()
{
int n;
printf("计算n!\n请输入n的值:");
scanf("%d",&n);
printf("\n结果是:%d",X(n));
return 0;
}
int X(int n)
{
int i,s=1;
if(n==0)
return(1);
else
{
for(i=1;i<=n;i++)
{
s=s*i;
}
return(s);
}
}
(2)递归法:recursion
#include
int X(int);
int main()
{
int n;
printf("计算n!\n请输入n的值:");
scanf("%d",&n);
printf("结果为:%d",X(n));
return 0;
}
int X(int n)
{
if(n<=1)
return(1);
else
return n*X(n-1);
}