经典C语言源代码.docx

经典C语言源代码
1、（1）某年某月某日是星期几
#in clude<> in tmai n()
{
in tyear,m on th,day;
while(sca nf_s("%d%d%d", &year,&mon th, &day)!=EOF)
{
if(mo nth==1||mo nth==2)〃 判断 mon th 是否为 1 或 2
{
year--;
mon th+=12;
}
in tc=year/1OO;
in ty=year-c*1OO;
in tweek=(c/4)-2*c+(y+y/4)+(13*(mo nth+1)/5)+day-1;
while(week<0){week+=7;}
week%=7;
switch(week)
{
case1:pri ntf("M on day\n");break;
case2:pri ntf("Tuesday\n");break;
case3:pri ntf("Wed nesday\n" );break;
case4:pri ntf("Thursday\n");break;
case5:pri ntf("Friday\n");break;
case6:pri ntf("Saturday\n" );break;
caseO:pri ntf("S un day\n");break;
}
}
returnO;
}
1、(2)某年某月某日是第几天(一维数组) #i nclude""
voidmai n(){
in ti,flag,year,m on th,day,dayth;
intmon th_day[]={0,31,28,31,30,31,30,31,31,30,31,30,3
1}；
printf(" 请输入年/月/日：\n");
sea nf_s("%d/%d/%d", &year,&mo nth, &day);
dayth=day;
flag=(year%400==0)||(year%4==0&&year%100!=0);
if(flag)
mo nth_day[2]=29;
for(i=1;i<mo nth;i++)
dayth=dayth+m on th_day[i];
prin tf("%d/%d/%d 是第 %d天 \n",year,mo nth,day,dayth);
}
2、30个数中找最小的数及其位置
#i nclude""
#defi neSIZE30
voidmai n(){
in ti;
floatdata[SIZE];
in tmi n;
\n",SIZE);
printf(" 请输入％d个浮点数:
for(i=0;i<SIZE;i++){
//scan f_s("%f", &data[i]); data[i]=ra nd()%30+1; printf("%f 、",data[i]);
}
mi n=0;
for(i=1;i<SIZE;i++){ if(data[i]<data[mi n]) min=i;
}
printf(” 最小值是 ％,位置是 %5d\n",data[min],min);
3、30个数从小到大排序
(1)
#i nclude""
#defi neSIZE30
voidmai n(){
in ti,j;
floatdata[SIZE],temp;
in tmi n;
\n",SIZE);
printf(" 请输入％d个整型数:
for(i=0;i<SIZE;i++){
sca nf_s("%f", &data[i]);
}
for(i=0;i<SIZE;i++){
min=i;
for(j=i+1;j<SIZE;j++)
if(data[j]<data[mi n])
mi n=j; temp=data[mi n];
data[mi n]=data[i]; data[i]=temp;
}
prin tf("\n 排序后的结果是：\n");
for(i=0;i<SIZE;i++)
prin tf("%",data[i]);
}
(2)模块化程序(数组名作为函数参数)
#i nclude""
#defi neSIZE5
voidaccept_array(floata[],i ntsize); voidsort(floata[],i ntsize); voidshow_array(floata[],i ntsize);
voidmai n(){
floa