C语言培训_004

小程序练习：

1.求圆形的面积s和周长c

#include"stdio.h"int main(){printf("输入圆的半径：\n");float r,c,s;scanf("%f",&r);s=r*r*3.14159;c=r*2*3.14159;printf("s=%5.5f\nc=%5.5f\n\n",s,c);return 0;}

2.求a和b的四则运算

#include"stdio.h"int main(){printf("输入a（空格）b的值\n"); int a,b;scanf("%d%d",&a,&b);printf("a+b=%d\n",a+b);printf("a-b=%d\n",a-b); printf("a*b=%d\n",a*b);printf("a/b=%0.5f",a*1.0/b);return 0;}

3.判断三角形

#include"stdio.h"int main(){printf("输入3个边长 a (空格) b (空格) c(回车)\n"); float a,b,c;scanf("%f%f%f",&a,&b,&c);int n=0;if(a+b>c&&a+c>b&&b+c>a){if(a*a+b*b==c*c||a*a+c*c==b*b||b*b+c*c==a*a){printf("\n可以构成直角三角形\n");n=1; }else if(a*a+b*b<c*c||a*a+c*c<b*b||b*b+c*c<a*a) {printf("\n可以构成钝角三角形\n");n=2;}else if(a*a+b*b>c*c&&a*a+c*c>b*b&&b*b+c*c>a*a){printf("\n可以构成锐角三角形\n");n=3; } }else{printf("不能构成三角形\n");}return 0;}

4.斐波那契额前五项

#include"stdio.h"int main(){int n1=1,n2=1;for(int i=1;i<=10;i++){printf("%d\t",n1);n2=n1+n2;n1=n2-n1;if((i+5)%5==0){printf("\n");}}return 0;}

5.最小公倍数

#include"stdio.h"int main(){int a,b,i=1,s;printf("输入 a（空格）b ：\n");scanf("%d%d",&a,&b);int max=a>b?a:b,min=a<b?a:b;while(1){s=i*max;if(s%min==0){break;}i++;}printf("%d和%d的最小公倍数为：%d\n",a,b,s);return 0;}

6.日期函数

#include"stdio.h"#include"stdbool.h" typedef struct riqi{int nian;int yue;int ri;}riqi;riqi today() {printf("请输入今天日期\n");riqi jintian;int nian,yue,ri;scanf("%d%d%d",&nian,&yue,&ri);jintian.nian=nian;jintian.yue=yue;jintian.ri=ri;return jintian;}void P(riqi rizi){printf("%4d年%2d月%2d日",(rizi.nian),(rizi.yue),(rizi.ri));} bool runnian(int nian){bool b=0;if((nian%400==0)||(nian%100!=0&&nian%4==0))b=true;elseb=false;return b;}riqi jia(int days){riqi jintian=today();riqi jieguo;jieguo=jintian;jieguo.ri=jintian.ri+days;Loop:if(jieguo.yue==13){jieguo.nian=jieguo.nian+1;jieguo.yue=1;}if((jieguo.yue==4||jieguo.yue==6||jieguo.yue==9||jieguo.yue==11)&&jieguo.ri>30){jieguo.ri=jieguo.ri-30;jieguo.yue=jieguo.yue+1;goto Loop;}if((jieguo.yue==1||jieguo.yue==3||jieguo.yue==5||jieguo.yue==7||jieguo.yue==8||jieguo.yue==10||jieguo.yue==12)&&jieguo.ri>31){jieguo.ri=jieguo.ri-31;jieguo.yue=jieguo.yue+1;goto Loop; }if(runnian(jieguo.nian)==true&&jieguo.yue==2&&jieguo.ri>29){jieguo.ri=jieguo.ri-29;jieguo.yue=3;goto Loop;}if(runnian(jieguo.nian)==false&&jieguo.yue==2&&jieguo.ri>28){jieguo.ri=jieguo.ri-28;jieguo.yue=3;goto Loop;}P(jintian);printf("加上%d天后的",days); printf("结果日期为：");P(jieguo);}int main(){int days;printf("输入距离今天的天数");scanf("%d",&days);jia(days);return 0;}

7.凯撒密码（有结束符）

#include"stdio.h"#include"stdlib.h"unsigned char *jiami(unsigned char *a){for(int i=0;a[i]!='\0';i++){if((a[i]>='a'&&a[i]<'x')||(a[i]>='A'&&a[i]<'X')){a[i]=a[i]+3;}else if((a[i]>='x'&&a[i]<='z')||(a[i]>='X'&&a[i]<='Z')){a[i]=a[i]-23;}}printf("加密后是：%s\n",a);return a;}unsigned char *jiemi(unsigned char *a){for(int i=0;a[i]!='\0';i++){if((a[i]>='d'&&a[i]<='z')||(a[i]>='D'&&a[i]<='Z')){a[i]=a[i]-3;}else if((a[i]>='a'&&a[i]<='c')||(a[i]>='A'&&a[i]<='c')){a[i]=a[i]+23;}}printf("解密后是：%s\n",a);return a;}int main(){unsigned char a[]="HAPPY NEW YEAR happy new yeaar";printf("原数组为：%s\n",a);jiami(a);jiemi(a); return 0;}

8.int型冒泡排序

#include"stdio.h"unsigned int *maopaopaixu(unsigned int *a,int geshu){for(int i=0;i<geshu-1;i++){for(int j=i;j<geshu;j++){if(a[i]>a[j]){int temp=a[j];a[j]=a[i];a[i]=temp;}}} return a;}void P(unsigned int *a,int geshu){for(int i=0;i<geshu;i++){printf("a[%d]=%d\n",i+1,a[i]);}}int main(){unsigned int a[]={9,8,8,6,5,1,9,9,3};printf("\n原数列为：\n");P(a,9); maopaopaixu(a,9);printf("\n冒泡排序的结果为：\n");P(a,9);return 0;}

9.int型插入排序

#include"stdio.h"unsigned int *ChaRupaixu(unsigned int *a,int geshu){int temp,j;for(int i=1;i<geshu;i++){temp=a[i];j=i-1;while(j>=0&&a[j]>temp){a[j+1]=a[j];j--;}}return a;}void P(unsigned int *a,int geshu){for(int i=0;i<geshu;i++){printf("a[%d]=%d\n",i+1,a[i]);}}int main(){unsigned int c[]={3,1,4,6,5,1,9,4,3};printf("\n原数列为：\n"); P(c,9);ChaRupaixu(c,9);printf("\n插入排序的结果为：\n");P(c,9);return 0;}