资源预览内容
第1页 / 共13页
第2页 / 共13页
第3页 / 共13页
第4页 / 共13页
第5页 / 共13页
第6页 / 共13页
第7页 / 共13页
第8页 / 共13页
第9页 / 共13页
第10页 / 共13页
亲,该文档总共13页,到这儿已超出免费预览范围,如果喜欢就下载吧!
资源描述
网站上机程序参考源代码1. 编程题 1:sizeof 测试字节数#include int main() printf(sizeof(char)=%dn,sizeof(char); printf(sizeof(int)=%dn,sizeof(int); printf(sizeof(short)=%dn,sizeof(short); printf(sizeof(long)=%dn,sizeof(long); printf(sizeof(unsigned int)=%dn,sizeof(unsigned int ); printf(sizeof(float)=%dn,sizeof(float); printf(sizeof(double)=%dn,sizeof(double); return 0; 2. 编程题 2:输入/输出练习#include int main() int a=20; float b; double c; b=12.345f; scanf(%lf, printf(a=%dn,a); printf(b=%fn,b); printf(c=%fn,c); return 0; 3. 编程题 3:用 if 语句求解分段函数#include int main( ) double x,y; scanf(%lf, if (xint main( )int year,month,day;scanf(%d%d,switch(month)case 1:case 3:case 5:case 7:case 8:case 10:case 12: day=31; break;case 4:case 6:case 9:case 11: day=30; break;case 2: day=28;if (year%4=0&year%100!=0|year%400=0)day=29;break;default: printf(error monthn);5. 编程题 5:输出所有的 3 位数字的质数#include #include int main()int m,i,k,prime,count=0;for (m=101;m#includeint main( )double x,term=1,i=1,sum=0;int sign=1;scanf(%lf,doterm=term*x/i;sum+=sign*term;sign=-sign;i+;while(fabs(term)=1e-5);printf(sum=%.2fn,sum);return 0;7. 编程题 7:求平均值#includeint main( )int i,a20,max,min,sum=0,count=0;for (i=0;imax) max=ai;else if(aiint main( )int n,f40,i;doscanf(%d,while (n40);f0=f1=1;for (i=2;iint main( )int a20; int i=0,j,x,total=0,s=0; do scanf(%d,while(ai-1);s=total=i; scanf(%d, printf(Before delete,elements are:n);for (i=0;i#include void create(int a ,int n); void print(int a ,int n); /输出所有的元素int main() int n,*array;scanf(%d, /读入整数 n,再调用 calloc 函数产生大小为 n 的数组array=(int *)calloc(n,sizeof(int);create(array,n); /调用 create 函数产生 n 个元素print(array,n); /调用free(array);return 0;void create(int a ,int n) int i; for (i=0;i#include void Find(int *a,int n,int *max,int *maxPos,int *min,int *minPos); int main() int array10=23,45,90,-9,43,90,4,2,-9;int max,min,maxPos=0,minPos=0; Find(array,10,printf(max=%d, maxPos=%d, min=%d, minPos=%dn,max,maxPos,min,minPos); return 0;void Find(int *a,int n,int *max,int *maxPos,int *min,int *minPos)int i;*max=*min=a0;for (i=1;i*max) *max=ai;*maxPos=i;else if(aiint OctToBin(int n,int *p)int i,r,k=0;while (n) r=n%8; for (i=1;i=0;i-)printf(%d,arrayi);printf(n);return 0;13. 编程题 13:最大公约数。#includeint gcd(int m,int n)int r;r=m%n;if (!r)return n;else return gcd(n,r);int main( )int m,n;do scanf(%d%d,while(m#include#define S(a,b,c) (a)+(b)+(c)/2#define AREA(s,a,b,c) sqrt(s)*(s)-(a)*(s)-(b)*(s)-(c)int main( )double a,b,c,s,area;scanf(%lf%lf%lf,if (a#define LEAP_YEAR(y) (y)%400=0|(y)%4=0&(y)%100!=0int main( )int year;scanf(%d,if(year=10000|yeartypedef struct Student int num;char name20;int score;STU; void input(STU *t,int n) int i;for (i=0;ihigh-score)high=t+i;*ave=sum*1.0/n; return high; int main( )STU team3,*high=NULL;double ave;input(team,3); high=average(team,3, printf(The average score=%.2fn,ave); printf(The student who has the highest score is:n); printf(%dt%st%dn,high-num,high-name,high-score);return 0;17. 编程题 17:根据输入日期输出对应季节#includeenum Seasons Spring,Summer,Autumn,Winter;struct Dateint year,month,day;int main( )struct Date d;enum Seasons s;scanf(%d%d%d,if (d.month=3&d.month=6&d.month=9&d.monthint input(char *s) int i=0;char c;doc=getchar();if (c=0&c=A&c=a&c=0&si=A&si=a&si#includevoid reverse(char *s)char *p=s,*q,t;int len=strlen(s);q=p+len-1;while (pint change(char *source,char * des)int i=0;while (*source)if (*source=0&*sourceint main( )int y1010=0,i,j,n;scanf(%d,for (i=1;i#define N 4int isSymmetrical(int (*p)N)int i,j;for (i=0;i#includevoid Display(char pa20,int n) /输出 n 个字符串int i;for(i=0;in;i+)printf(%s ,pai); /pai可以写成*(pa+i);printf(n);void Selection(char pa20,int n) /选择排序函数定义int i,k,index;char temp20;for (k=0;kn-1;k+) index=k ; for(i=k+1;in;i+) if (strcmp(pai,paindex)0) index=i;if (index!=k) strcpy(temp,paindex);strcpy(paindex,pak);strcpy(pak,temp); int main( )char a620;int i;for( i=0; i6; i+ )gets(ai);Selection(a,6);Display(a,6); return 0;
收藏 下载该资源
网站客服QQ:2055934822
金锄头文库版权所有
经营许可证:蜀ICP备13022795号 | 川公网安备 51140202000112号