1 条题解
-
0
C :
#include<stdio.h> int count(int a[12],int b[12],int year,int mounth,int day) { int i,sum=0; if(year%4==0&&year%100!=0||year%400==0) for(i=0;i<mounth-1;i++) { sum+=a[i]; } else for(i=0;i<mounth-1;i++) { sum+=b[i]; } sum+=day; return(sum); } void main(){ int year,mounth,day,m; int a[12]={31,29,31,30,31,30,31,31,30,31,30,31},b[12]={31,28,31,30,31,30,31,31,30,31,30,31}; scanf("%d %d %d",&year,&mounth,&day); m=count(a,b,year,mounth,day); printf("%d\n",m); }
C++ :
#include<stdio.h> int main() {int zong(int yue,int ri); int nunnian(int nian); int nian,yue,ri,tian; scanf("%d%d%d",&nian,&yue,&ri); tian=zong(yue,ri); if(nunnian(nian)&&yue>=3) tian=tian+1; printf("%d\n",tian); return 0; } int zong(int yue,int ri) { int ri_tab[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int l; for(l=1;l<yue;l++) ri+=ri_tab[l]; return(ri); } int nunnian(int nian) {int nunnian; nunnian=nian%4==0&&nian%100!=0||nian%400==0; return(nunnian); }
- 1
信息
- ID
- 493
- 时间
- 1000ms
- 内存
- 12MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者