未运用结构体
#include struct Date{ int nian; int yue; int ri; }; int main() { int a=0,m,n,i,j; scanf("%d%d%d",&m,&n,&i); if(m%4==0&&m||m%400==0) { switch(n-1){ case 12:a+=31; case 11:a+=30; case 10:a+=31; case 9:a+=30; case 8:a+=31; case 7:a+=31; case 6:a+=30; case 5:a+=31; case 4:a+=30; case 3:a+=31; case 2:a+=29; case 1:a+=31; default:a+=0; } } else{ switch(n-1){ case 12:a+=31; case 11:a+=30; case 10:a+=31; case 9:a+=30; case 8:a+=31; case 7:a+=31; case 6:a+=30; case 5:a+=31; case 4:a+=30; case 3:a+=31; case 2:a+=28; case 1:a+=31; default:a+=0; }} printf("%d",a+i); }
运用结构体
#include<stdio.h> struct Date { int nian; int yue; int ri; }; int main() { struct Date a; int t[12]={31,28,31,30,31,30,31,31,30,31,30,31}; int i,sum=0; scanf("%d%d%d",&a.nian,&a.yue,&a.ri); if((a.nian%4==0&&a.nian%100!=0)||(a.nian%400==0)) t[1]=29; for(i=0;i<a.yue-1;i++) { sum+=t[i]; } sum+=a.ri; printf("%d",sum); return 0; }
0.0分
1 人评分