label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
---|---|---|
11 | 5000 | int leap(int n)
{
if(n%4==0&&n%100!=0)
{
return 1;
}
else if(n%400==0)
{
return 1;
}
else
{
return 0;
}
}
void main()
{
int year,month,day,x;
scanf("%d %d %d",&year,&month,&day);
if(leap(year)==1)
{
if(month==1)
{
x=day;
}
if(month==2)
{
x=day+31;
}
if(month==3)
{
x=day+60;
}
if(month==4)
{
x=day+91;
}
if(month==5)
{
x=day+121;
}
if(month==6)
{
x=day+152;
}
if(month==7)
{
x=day+182;
}
if(month==8)
{
x=day+213;
}
if(month==9)
{
x=day+244;
}
if(month==10)
{
x=day+274;
}
if(month==11)
{
x=day+305;
}
if(month==12)
{
x=day+335;
}
}
else
{
if(month==1)
{
x=day;
}
if(month==2)
{
x=day+31;
}
if(month==3)
{
x=day+59;
}
if(month==4)
{
x=day+90;
}
if(month==5)
{
x=day+120;
}
if(month==6)
{
x=day+151;
}
if(month==7)
{
x=day+181;
}
if(month==8)
{
x=day+212;
}
if(month==9)
{
x=day+243;
}
if(month==10)
{
x=day+273;
}
if(month==11)
{
x=day+304;
}
if(month==12)
{
x=day+334;
}
}
printf("%d",x);
} |
11 | 5001 | int main(){
int year,month,day,sum=0;
int monthday[12]={31,29,31,30,31,30,31,31,30,31,30,31};
scanf("%d%d%d",&year,&month,&day);
for(int i=1;i<month;i++){
sum+=monthday[i-1];
}
sum+=day;
if(month>2&&(!year%4==0&&year%100!=0||year%400!=0)){
sum-=1;
}
printf("%d",sum);
return 0;
} |
11 | 5002 |
void main()
{
int y,m,d,a,i,ans;
for (i=1;i<=5;i++)
{
scanf("%d%d%d",&y,&m,&d);
if (y%4!=0)
a=1;
else if (y%100!=0)
a=0;
else if (y%400!=0)
a=1;
else
a=0;
if (a)
{
switch(m)
{
case 1: ans=d; break;
case 2: ans=31+d; break;
case 3: ans=59+d; break;
case 4: ans=90+d; break;
case 5: ans=120+d; break;
case 6: ans=151+d; break;
case 7: ans=181+d; break;
case 8: ans=212+d; break;
case 9: ans=243+d; break;
case 10: ans=273+d; break;
case 11: ans=304+d; break;
case 12: ans=334+d; break;
}
}
else
{
switch(m)
{
case 1: ans=d; break;
case 2: ans=31+d; break;
case 3: ans=60+d; break;
case 4: ans=91+d; break;
case 5: ans=121+d; break;
case 6: ans=152+d; break;
case 7: ans=182+d; break;
case 8: ans=213+d; break;
case 9: ans=244+d; break;
case 10: ans=274+d; break;
case 11: ans=305+d; break;
case 12: ans=335+d; break;
}
}
printf("%d\n",ans);
}
}
|
11 | 5003 | int main(int argc, char* argv[])
{
int year,month,date;
int a=0;
scanf("%d %d %d",&year,&month,&date);
if(((year%4==0)&&(year%100!=0))||year%400==0){
switch (month){
case 1:a=date;break;
case 2:a=31+date;break;
case 3:a=31+29+date;break;
case 4:a=31+29+31+date;break;
case 5:a=31+29+31+30+date;break;
case 6:a=31+29+31+30+31+date;break;
case 7:a=31+29+31+30+31+30+date;break;
case 8:a=31+29+31+30+31+30+31+date;break;
case 9:a=31+29+31+30+31+30+31+31+date;break;
case 10:a=31+29+31+30+31+30+31+31+30+date;break;
case 11:a=31+29+31+30+31+30+31+31+30+31+date;break;
case 12:a=31+29+31+30+31+30+31+31+30+31+30+date;break;
}
}
else{
switch(month){
case 1:a=date;break;
case 2:a=31+date;break;
case 3:a=31+28+date;break;
case 4:a=31+28+31+date;break;
case 5:a=31+28+31+30+date;break;
case 6:a=31+28+31+30+31+date;break;
case 7:a=31+28+31+30+31+30+date;break;
case 8:a=31+28+30+31+30+31+date;break;
case 9:a=31+28+31+30+31+30+31+31+date;break;
case 10:a=31+28+31+30+31+30+31+31+30+date;break;
case 11:a=31+28+31+30+31+30+31+31+30+31+date;break;
case 12:a=31+28+31+30+31+30+31+31+30+31+30+date;break;
}
}
printf("%d\n",a);
return 0;
} |
11 | 5004 | int main(int argc, char* argv[])
{int year,month,day;
scanf("%d %d %d",&year,&month,&day);
int sum=0;
if(year%4==0&&year%100!=0||year%400==0)
{int mon[12]={31,29,31,30,31,30,31,31,30,31,30,31};
if(month==1)
sum=day;
else if(month==2)
sum=31+day;
else
{for(int i=0;i<=(month-2);i++)
{sum+=mon[i];}
sum=sum+day;
}
printf("%d",sum);
}
else if(year%4!=0||year%100==0&&year%400!=0)
{if(month==1)
sum=day;
else if(month==2)
sum=31+day;
else
{int mon[12]={31,28,31,30,31,30,31,31,30,31,30,31};
for(int i=0;i<=(month-2);i++)
{sum+=mon[i];}
sum=sum+day;
} printf("%d",sum);
}
return 0;
}
|
11 | 5005 |
int main()
{
int a,b,c,feb,i,m,n=0,q;
scanf("%d%d%d",&a,&b,&c);
if( (a%4==0&&a%100!=0)||a%400==0)
{
feb=29;
}
else
{
feb=28;
}
for (i=1;i<b;i++)
{
if (i==1||i==3||i==5||i==7||i==8||i==10||i==12)
m=31;
else if(i==2)
m=feb;
else
m=30;
n=n+m;
}
q=n+c;
printf("%d",q);
return 0;
}
|
11 | 5006 |
int main(int argc, char* argv[])
{
int year,month,day,a;
scanf("%d %d %d",&year,&month,&day);
if(year%4==0&&year%100!=0||year%400==0){
if(month==1)
a=day;
if(month==2)
a=day+31;
if(month==3)
a=day+60;
if(month==4)
a=day+91;
if(month==5)
a=day+121;
if(month==6)
a=day+152;
if(month==7)
a=day+182;
if(month==8)
a=day+213;
if(month==9)
a=day+244;
if(month==10)
a=day+274;
if(month==11)
a=day+305;
if(month==12)
a=day+335;}
else
{
if(month==1)a=day;
if(month==2)a=day+31;
if(month==3)a=day+59;
if(month==4)a=day+90;
if(month==5)a=day+120;
if(month==6)a=day+151;
if(month==7)a=day+181;
if(month==8)a=day+212;
if(month==9)a=day+243;
if(month==10)a=day+273;
if(month==11)a=day+304;
if(month==12)a=day+334;};
printf("%d\n",a);
return 0;
}
|
11 | 5007 | main ()
{
int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int year,month,day;
scanf ("%d %d %d",&year,&month,&day);
int i,j,k;
if (year%400==0||year%4==0&&year%100!=0)
a[1]=29;
for (i=0,j=day;i<month-1;i++)
j=j+a[i];
printf ("%d",j);
getchar ();
getchar ();
}
|
11 | 5008 |
int main()
{
int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int year,month,day,i,k,sum=0;
cin>>year>>month>>day;
if (year%400==0) //????
k=1;
else if (year%100==0)
k=0;
else if (year%4==0)
k=1;
else
k=0;
if (k==1)
a[1]=29;
for (i=0;i<month-1;i++)
sum+=a[i];
sum+=day;
cout<<sum<<endl;
return 0;
} |
11 | 5009 |
int main(int argc, char* argv[])
{
int x,y,z,i,n;
scanf("%d %d %d",&x,&y,&z);
if(x%400==0)
i=1;
else
{
if(x%100==0)
i=0;
else
{
if(x%4==0)
i=1;
else
i=0;
}
}
if(i==1)
{
switch(y)
{
case 1:n=z;break;
case 2:n=31+z;break;
case 3:n=31+29+z;break;
case 4:n=31+29+31+z;break;
case 5:n=31+29+31+30+z;break;
case 6:n=31+29+31+30+31+z;break;
case 7:n=31+29+31+30+31+30+z;break;
case 8:n=31+29+31+30+31+30+31+z;break;
case 9:n=31+29+31+30+31+30+31+31+z;break;
case 10:n=31+29+31+30+31+30+31+31+30+z;break;
case 11:n=31+29+31+30+31+30+31+31+30+31+z;break;
case 12:n=31+29+31+30+31+30+31+31+30+31+30+z;break;
}
}
else
{
switch(y)
{
case 1:n=z;break;
case 2:n=31+z;break;
case 3:n=31+28+z;break;
case 4:n=31+28+31+z;break;
case 5:n=31+28+31+30+z;break;
case 6:n=31+28+31+30+31+z;break;
case 7:n=31+28+31+30+31+30+z;break;
case 8:n=31+28+31+30+31+30+31+z;break;
case 9:n=31+28+31+30+31+30+31+31+z;break;
case 10:n=31+28+31+30+31+30+31+31+30+z;break;
case 11:n=31+28+31+30+31+30+31+31+30+31+z;break;
case 12:n=31+28+31+30+31+30+31+31+30+31+30+z;break;
}
}
printf("%d",n);
return 0;
}
|
11 | 5010 | main()
{
int day,month,year,sum,leap;
scanf("%d%d%d",&year,&month,&day);
switch(month)
{
case 1:sum=0;break;
case 2:sum=31;break;
case 3:sum=59;break;
case 4:sum=90;break;
case 5:sum=120;break;
case 6:sum=151;break;
case 7:sum=181;break;
case 8:sum=212;break;
case 9:sum=243;break;
case 10:sum=273;break;
case 11:sum=304;break;
case 12:sum=334;break;
default:printf("data error\n");break;
}
sum=sum+day;
if(year%400==0||(year&4==0&&year%100!=0))
leap=1;
else
leap=0;
if(leap==1&&month>2)
sum=sum+1;
printf("%d\n",sum);
getchar();
getchar();
}
|
11 | 5011 | int main()
{
int max[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}, i, rank=0, y, m, d ;
cin>>y>>m>>d;
if(y%4==0 && y%100!=0 || y%400==0)
max[2]+=1;;
for(i=1;i<m;i++)
{
rank+=max[i];
}
rank+=d;
cout<<rank;
int x;cin>>x;
return 0;
}
|
11 | 5012 | int main()
{
int y,m,d,i;
scanf("%d %d %d",&y,&m,&d);
int n[12]={31,28,31,30,31,30,31,31,30,31,30,31};
if(y%100==0&&y%400==0)
n[1]=29;
if(y%100!=0&&y&4==0)
n[1]=29;
int sum=0;
for(i=0;i<m-1;i++)
sum=sum+n[i];
printf("%d\n",sum+d);
getchar();
getchar();
}
|
11 | 5013 |
int main()
{
int year,month,day;
scanf("%d %d %d",&year,&month,&day);
int dmonth[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int i=0;
int sum=0;
for (i=0;i<month-1;i++){
sum=sum+dmonth[i];
}
if (year%4==0&&year%100!=0||year%400==0){
if (month>=3){
sum=sum+day+1;
}
}
else {
sum=sum+day;
}
printf("%d",sum);
return 0;
} |
11 | 5014 | int main()
{
int b, c, d, sum=0;
int a[20];
a[0]=0;
a[1]=31;
a[2]=59;
a[3]=90;
a[4]=120;
a[5]=151;
a[6]=181;
a[7]=212;
a[8]=243;
a[9]=273;
a[10]=304;
a[11]=334;
a[12]=365;
scanf("%d%d%d", &b, &c, &d);
if((b%4!=0)||(b%100==0&&b%400!=0)){
sum=a[c-1]+d;
}
else{
if(c<3){
sum=a[c-1]+d;
}
else{
sum=a[c-1]+d+1;
}
}
printf("%d", sum);
return 0;
} |
11 | 5015 | int rui(int y,int m){
if((y%4==0&&y%100!=0)||(y%400==0)&&m==2)
return 1;
else return 0;
}
int main(){
int d=0,y,m,r,i;
int pp[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
cin>>y>>m>>r;
for(i=1;i<m;i++)
d=d+pp[i]+rui(y,i);
d=d+r;
cout<<d<<endl;
return 0;
} |
11 | 5016 | int main()
{
int a,b,c;
cin>>a>>b>>c;
if(!((a%4==0&&a%100!=0)||(a%4==0&&a%400==0)))
{if(b==1)
cout<<c;
if(b==2)
cout<<31+c;
if(b==3)
cout<<60+c-1;
if(b==4)
cout<<91+c-1;
if(b==5)
cout<<121+c-1;
if(b==6)
cout<<152+c-1;
if(b==7)
cout<<182+c-1;
if(b==8)
cout<<213+c-1;
if(b==9)
cout<<244+c-1;
if(b==10)
cout<<274+c-1;
if(b==11)
cout<<305+c-1;
if(b==12)
cout<<335+c-1;}
else
{if(b==1)
cout<<c;
if(b==2)
cout<<31+c;
if(b==3)
cout<<60+c;
if(b==4)
cout<<91+c;
if(b==5)
cout<<121+c;
if(b==6)
cout<<152+c;
if(b==7)
cout<<182+c;
if(b==8)
cout<<213+c;
if(b==9)
cout<<244+c;
if(b==10)
cout<<274+c;
if(b==11)
cout<<305+c;
if(b==12)
cout<<335+c;
}return 0;
} |
11 | 5017 | main()
{
int year,month,day,sum=0,sm=0,k;
scanf("%d %d %d",&year,&month,&day);
if((((year%4==0)&&(year%100!=0))||(year%400==0))!=0)
{
int m[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
for(k=0;k<month;k++)
sum=sum+m[k];
sum=sum+day;
printf("%d",sum);
}
else
{
int n[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
for(k=0;k<month;k++)
sm=sm+n[k];
sm=sm+day;
printf("%d",sm);
}
getchar();
getchar();
}
|
11 | 5018 |
int main()
{
int year;
int month;
int day;
int data1[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int data2[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int in = 0;
scanf("%d %d %d",&year,&month,&day);
if ( year%4 == 0 || year%100 == 0 && year%400 == 0)
{
int i = month - 1;
for (; i >= 0; i--)
{
in += data2[i];
}
in += day;
}
else
{
int i = month - 1;
for (; i >= 0; i--)
{
in += data1[i];
}
in += day;
}
printf("%d\n",in);
return 0;
} |
11 | 5019 | int X1(int y ,int z)//?????????????????
{
int j;
switch (y) //?????????????
{
case 1:j = z;break;
case 2:j = 31 + z;break;
case 3:j = 59 + z;break;
case 4:j = 90 + z;break;
case 5:j = 120 + z;break;
case 6:j = 151 + z;break;
case 7:j = 181 + z;break;
case 8:j = 212 + z;break;
case 9:j = 243 + z;break;
case 10:j = 273 + z;break;
case 11:j = 304 + z;break;
default:j = 334 + z;break;
}
return (j);
}
int X2(int y ,int z)//????????????????
{
int j;
switch (y) //?????????????
{
case 1:j = z;break;
case 2:j = 31 + z;break;
case 3:j = 60 + z;break;
case 4:j = 91 + z;break;
case 5:j = 121 + z;break;
case 6:j = 152 + z;break;
case 7:j = 182 + z;break;
case 8:j = 213 + z;break;
case 9:j = 244 + z;break;
case 10:j = 274 + z;break;
case 11:j = 305 + z;break;
default:j = 335 + z;break;
}
return (j);
}
int main()
{
int y , m, d;
cin>>y>>m>>d;
cout<<endl;
int num;
if (y%100==0)
{//?????????
if (y%400==0)//???????
num=X2(m,d);
else num=X1(m,d);
}
else
{
if (y%4==0)//???????
num=X2(m,d);
else num=X1(m,d);
}
cout<<num<<endl;
return 0;
}
|
11 | 5020 | int main()
{
int i,p,n[5]={0},year[5],month[5],day[5],days[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
for(i=0;i<5;i++)
{
scanf("%d%d%d",&year[i],&month[i],&day[i]);
if ((year[i]%4==0&&year[i]%100!=0)||year[i]%400==0) days[2]=29;
else days[2]=28;
for(p=0;p<month[i];p++)
n[i]=n[i]+days[p];
n[i]=n[i]+day[i];
}
for(i=0;i<5;i++)
printf("%d\n",n[i]);
return 0;
}
|
11 | 5021 | int main()
{
int Year,Month,Date;
int month;
int i;
int sum1=0,sum2=0;
scanf("%d %d %d",&Year,&Month,&Date);
month=Month-1;
if(Year%4==0&&Year%400==0){
int mday[12]={31,29,31,30,31,30,31,31,30,31,30,31};
for(i=0;i<month;i++)
sum1=sum1+mday[i];
}
else
{
int mday[12]={31,28,31,30,31,30,31,31,30,31,30,31};
for(i=0;i<month;i++)
sum1=sum1+mday[i];
}
sum2=sum1+Date;
printf("\n%d",sum2);
return 0;
}
|
11 | 5022 |
void main(){
int a,b,c;
int leap=0;
int day=0;
scanf("%d%d%d",&a,&b,&c);
if(a%400==0||(a%4==0&&a%100!=0))leap=1;
b--;
while(b){
if(b==1||b==3||b==5||b==7||b==8||b==10||b==12){
b--;
day+=31;
}
if(b==2){
b--;
day+=28+leap;
}
if(b==4||b==6||b==9||b==11){
b--;
day+=30;
}
}
day+=c;
printf("%d",day);
} |
11 | 5023 | int main ()
{
int daysa[12]={31,29,31,30,31,30,31,31,30,31,30,31};
int daysb[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int y,m,d;
int num=0;
scanf("%d%d%d",&y,&m,&d);
int i;
if((y%4==0&&y%100!=0)||(y%400==0))
{
for(i=1;i<=m-1;i++)
{
num=num+daysa[i-1];
}
num=num+d;
}
else
{
for(i=1;i<=m-1;i++)
{
num=num+daysb[i-1];
}
num=num+d;
}
printf("%d\n",num);
return 0;
}
|
11 | 5024 | int main()
{
int year,month,day;
int n;
scanf("%d %d %d",&year,&month,&day);
if((year%4==0 && year%100!=0)||year%400==0) //????
{
switch(month){
case 1:
n=day;
break;
case 2:
n=31+day;
break;
case 3:
n=60+day;
break;
case 4:
n=91+day;
break;
case 5:
n=121+day;
break;
case 6:
n=152+day;
break;
case 7:
n=182+day;
break;
case 8:
n=213+day;
break;
case 9:
n=244+day;
break;
case 10:
n=274+day;
break;
case 11:
n=305+day;
break;
case 12:
n=335+day;
break;
}
}
else
{
switch(month){
case 1:
n=day;
break;
case 2:
n=30+day;
break;
case 3:
n=59+day;
break;
case 4:
n=90+day;
break;
case 5:
n=120+day;
break;
case 6:
n=151+day;
break;
case 7:
n=181+day;
break;
case 8:
n=212+day;
break;
case 9:
n=243+day;
break;
case 10:
n=273+day;
break;
case 11:
n=304+day;
break;
case 12:
n=334+day;
break;
}
}
printf("%d",n);
return 0;
} |
11 | 5025 | int main()
{
int year,mon,day;
cin>>year>>mon>>day;
int days=0;
int ar[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int br[12]={31,29,31,30,31,30,31,31,30,31,30,31};
if(year%4==0&&year%100!=0||year%400==0)
{
for(int i=0;i<mon-1;i++)
days+=br[i];
}
else
{
for(int i=0;i<mon-1;i++)
days+=ar[i];
}
days+=day;
cout<<days<<endl;
return 0;
} |
11 | 5026 | int main()
{
int a,b,i,c,days;
int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d%d%d",&a,&b,&c);
days=0;
if((a%4==0&&a%100!=0)||(a%400==0))
{m[2]=29;
for(i=0;i<b;i++)
{days+=m[i];
}
printf("%d\n",days+c);
}
else
{
for(i=0;i<b;i++)
{
days+=m[i];
}
printf("%d\n",days+c);
}
return 0;
}
|
11 | 5027 |
int main()
{
int a, b, c, d;
scanf("%d %d %d",&a, &b, &c);
if (a%4 == 0 && a%100 != 0 || a%400 == 0)
{
int a[12] = {0,31,60,91,121,152,182,213,244,274,305,335};
d = a[b-1] + c;
printf("%d\n", d);
}
else
{
int a[12] = {0,31,59,90,120,151,181,212,243,273,304,334};
d = a[b-1] + c;
printf("%d\n", d);
}
return 0;
} |
11 | 5028 | int main()
{
int k,l,m,n;
scanf("%d\n%d\n%d",&k,&l,&m); //?????
if(k%4==0)
{if(k%100==0)
{if(k%400==0) //??
{
if((l>0)&&(l<2)){n=m;printf("%d",n);}
else if((l>1)&&(l<3)){n=(m+31);printf("%d\n",n);}
else if((l>2)&&(l<4)){n=(m+31+29);printf("%d\n",n);}
else if((l>3)&&(l<5)){n=(m+31+29+31);printf("%d\n",n);}
else if((l>4)&&(l<6)){n=(m+31+29+31+30);printf("%d\n",n);}
else if((l>5)&&(l<7)){n=(m+31+29+31+30+31);printf("%d\n",n);}
else if((l>6)&&(l<8)){n=(m+31+29+31+30+31+30);printf("%d\n",n);}
else if((l>7)&&(l<9)){n=(m+31+29+31+30+31+30+31);printf("%d\n",n);}
else if((l>8)&&(l<10)){n=(m+31+29+31+30+31+30+31+31);printf("%d\n",n);}
else if((l>9)&&(l<11)){n=(m+31+29+31+30+31+30+31+31+30);printf("%d\n",n);}
else if((l>10)&&(l<12)){n=(m+31+29+31+30+31+30+31+31+30+31);printf("%d\n",n);}
else if((l>11)&&(l<13)){n=(m+31+29+31+30+31+30+31+31+30+31+30);printf("%d\n",n);}
}
else //??
{
if((l>0)&&(l<2)){n=m;printf("%d",n);}
else if((l>1)&&(l<3)){n=(m+31);printf("%d\n",n);}
else if((l>2)&&(l<4)){n=(m+31+28);printf("%d\n",n);}
else if((l>3)&&(l<5)){n=(m+31+28+31);printf("%d\n",n);}
else if((l>4)&&(l<6)){n=(m+31+28+31+30);printf("%d\n",n);}
else if((l>5)&&(l<7)){n=(m+31+28+31+30+31);printf("%d\n",n);}
else if((l>6)&&(l<8)){n=(m+31+28+31+30+31+30);printf("%d\n",n);}
else if((l>7)&&(l<9)){n=(m+31+28+31+30+31+30+31);printf("%d\n",n);}
else if((l>8)&&(l<10)){n=(m+31+28+31+30+31+30+31+31);printf("%d\n",n);}
else if((l>9)&&(l<11)){n=(m+31+28+31+30+31+30+31+31+30);printf("%d\n",n);}
else if((l>10)&&(l<12)){n=(m+31+28+31+30+31+30+31+31+30+31);printf("%d\n",n);}
else if((l>11)&&(l<13)){n=(m+31+28+31+30+31+30+31+31+30+31+30);printf("%d\n",n);}
}
}else //??
{
if((l>0)&&(l<2)){n=m;printf("%d",n);}
else if((l>1)&&(l<3)){n=(m+31);printf("%d\n",n);}
else if((l>2)&&(l<4)){n=(m+31+29);printf("%d\n",n);}
else if((l>3)&&(l<5)){n=(m+31+29+31);printf("%d\n",n);}
else if((l>4)&&(l<6)){n=(m+31+29+31+30);printf("%d\n",n);}
else if((l>5)&&(l<7)){n=(m+31+29+31+30+31);printf("%d\n",n);}
else if((l>6)&&(l<8)){n=(m+31+29+31+30+31+30);printf("%d\n",n);}
else if((l>7)&&(l<9)){n=(m+31+29+31+30+31+30+31);printf("%d\n",n);}
else if((l>8)&&(l<10)){n=(m+31+29+31+30+31+30+31+31);printf("%d\n",n);}
else if((l>9)&&(l<11)){n=(m+31+29+31+30+31+30+31+31+30);printf("%d\n",n);}
else if((l>10)&&(l<12)){n=(m+31+29+31+30+31+30+31+31+30+31);printf("%d\n",n);}
else if((l>11)&&(l<13)){n=(m+31+29+31+30+31+30+31+31+30+31+30);printf("%d\n",n);}
}
}else //??
{
if((l>0)&&(l<2)){n=m;printf("%d",n);}
else if((l>1)&&(l<3)){n=(m+31);printf("%d\n",n);}
else if((l>2)&&(l<4)){n=(m+31+28);printf("%d\n",n);}
else if((l>3)&&(l<5)){n=(m+31+28+31);printf("%d\n",n);}
else if((l>4)&&(l<6)){n=(m+31+28+31+30);printf("%d\n",n);}
else if((l>5)&&(l<7)){n=(m+31+28+31+30+31);printf("%d\n",n);}
else if((l>6)&&(l<8)){n=(m+31+28+31+30+31+30);printf("%d\n",n);}
else if((l>7)&&(l<9)){n=(m+31+28+31+30+31+30+31);printf("%d\n",n);}
else if((l>8)&&(l<10)){n=(m+31+28+31+30+31+30+31+31);printf("%d\n",n);}
else if((l>9)&&(l<11)){n=(m+31+28+31+30+31+30+31+31+30);printf("%d\n",n);}
else if((l>10)&&(l<12)){n=(m+31+28+31+30+31+30+31+31+30+31);printf("%d\n",n);}
else if((l>11)&&(l<13)){n=(m+31+28+31+30+31+30+31+31+30+31+30);printf("%d\n",n);}
}
return 0;
} |
11 | 5029 | int main()
{
int a,b,c,n;
scanf("%d %d %d",&a,&b,&c);
if(((a%4==0)&&(a%100!=0))||(a%400==0))
{
if(b==1)
n=c;
else if(b==2)
n=31+c;
else if(b==3)
n=60+c;
else if(b==4)
n=91+c;
else if(b==5)
n=121+c;
else if(b==6)
n=152+c;
else if(b==7)
n=182+c;
else if(b==8)
n=213+c;
else if(b==9)
n=244+c;
else if(b==10)
n=274+c;
else if(b==11)
n=305+c;
else
n=336+c;
}
else
{
if(b==1)
n=c;
else if(b==2)
n=31+c;
else if(b==3)
n=59+c;
else if(b==4)
n=90+c;
else if(b==5)
n=120+c;
else if(b==6)
n=151+c;
else if(b==7)
n=181+c;
else if(b==8)
n=212+c;
else if(b==9)
n=243+c;
else if(b==10)
n=273+c;
else if(b==11)
n=304+c;
else
n=335+c;
}
printf("%d",n);
return 0;
}
|
11 | 5030 | int main()
{
int d,m,y,sum,leap;
scanf("%d %d %d",&y,&m,&d);
switch(m)
{
case 1:sum=0;break;
case 2:sum=31;break;
case 3:sum=59;break;
case 4:sum=90;break;
case 5:sum=120;break;
case 6:sum=151;break;
case 7:sum=181;break;
case 8:sum=212;break;
case 9:sum=243;break;
case 10:sum=273;break;
case 11:sum=304;break;
case 12:sum=334;break;
default:printf("data error");break;
}
sum=sum+d;
if(y%400==0||(y%4==0&&y%100!=0))
leap=1;
else
leap=0;
if(leap==1&&m>2)
sum++;
printf("%d",sum);
} |
11 | 5031 | int main()
{
int year,month1,day;
int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
cin>>year>>month1>>day;
int i;
int sum=0;
if(((year%4==0)&&(year%100!=0))||(year%400==0))
{
month[2]=month[2]+1;
for(i=1;i<month1;i++)
{
sum=sum+month[i];
}
sum=sum+day;
}
else
{
for(i=1;i<month1;i++)
{
sum=sum+month[i];
}
sum=sum+day;
}
cout<<sum;
return 0;
} |
11 | 5032 | int panduan(int(year));
int main()
{
int sum=0,year,month,day;
int i;
int Month1[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int Month2[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
cin>>year>>month>>day;
if(panduan(year)==1)
{
for(i=1;i<month;i++)
sum += Month1[i];
sum += day;
cout<<sum;
return 0;
}
else
{
for(i=1;i<month;i++)
sum += Month2[i];
sum += day;
cout<<sum;
return 0;
}
return 0;
}
int panduan(int year)
{
if(year%4==0&&year%100!=0||year%400==0)
return 1;
else
return 0;
}
|
11 | 5033 |
int main ()
{
int y = 0, m = 0, d = 0;
scanf ("%d %d %d", &y, &m, &d);
int days = 0;
int i;
if (y % 4 == 0)
{
int month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
for (i = 1; i < m; i++)
{
days = month[i] + days;
}
days = d + days;
}
else
{
int month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
for (i = 1; i < m; i++)
{
days = month[i] + days;
}
days = d + days;
}
printf ("%d\n", days);
return 0;
} |
11 | 5034 | int main()
{
int year[5], month[5], day[5], total[5],i=0;
for(;i<=4;i++)
{
scanf("%d %d %d", &year[i], &month[i], &day[i]);
}
for(i=0;i<=4;i++)
{
switch(month[i])
{
case 1: total[i]=day[i];break;
case 2: total[i]=31+day[i];break;
case 3: total[i]=31+28+day[i];break;
case 4: total[i]=31+28+31+day[i];break;
case 5: total[i]=31+28+31+30+day[i];break;
case 6: total[i]=31+28+31+30+31+day[i];break;
case 7: total[i]=31+28+31+30+31+30+day[i];break;
case 8: total[i]=31+28+31+30+31+30+31+day[i];break;
case 9: total[i]=31+28+31+30+31+30+31+31+day[i];break;
case 10: total[i]=31+28+31+30+31+30+31+31+30+day[i];break;
case 11: total[i]=31+28+31+30+31+30+31+31+30+31+day[i];break;
case 12: total[i]=31+28+31+30+31+30+31+31+30+31+30+day[i];break;
}
if ( (year[i]%400==0||year[i]%4==0&&year[i]%100!=0) && month[i]>2 ) total[i]+=1;
printf("%d\n",total[i]);
}
return 0;
}
|
11 | 5035 | int main() {
int year, month, day, sum = 0;
cin >> year >> month >> day;
int m1[12] ={ 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
int m2[12] ={ 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
for ( int i = 0; i <= month - 1; i ++ ) {
if ( i == month - 1 ) sum += day;
else {
if ( year % 4 == 0 && year % 100 != 0 || year % 400 == 0 )
sum += m2[i];
else
sum += m1[i];
}
}
cout << sum << endl;
return 0;
}
|
11 | 5036 | int main()
{
int y,m,d,n=0;
scanf("%d %d %d",&y,&m,&d);
int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};
if(y%4==0&&y%100!=0||y%400==0)
{
a[1]=29;
if(m==1)
n=n+d;
else
{
for(int i=1;i<m;i++)
n=n+a[i-1];
n=n+d;
}
}
else
{
if(m==1)
n=n+d;
else
{ for(int i=1;i<m;i++)
n=n+a[i-1];
n=n+d;
}
}
printf("%d",n);
getchar();
getchar();
}
|
11 | 5037 | int main()
{
int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int y,m,d,i,b;
scanf ("%d%d%d",&y,&m,&d);
if ((y%4==0&&y%100!=0)||(y%400==0))
a[2]=a[2]+1;
b=d;
for (i=1;i<m;i++)
{ b=a[i]+b;}
printf ("%d",b);
return 0;
}
|
11 | 5038 | int main()
{
int a[2][12]={31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31};
int y,m,d,i,sum=0;
cin>>y>>m>>d;
if((y%4==0&&y%100!=0)||(y%400==0))
{
for(i=0;i<m-1;i++)
{
sum=sum+a[1][i];
}
}
else
{
for(i=0;i<m-1;i++)
{
sum=sum+a[0][i];
}
}
sum+=d;
cout<<sum<<endl;
}
|
11 | 5039 | int main()
{
int aaa[5][3];
int year,mon,day,i,n,m;
int month[12];
month[0]=31,month[1]=28,month[2]=31,month[3]=30,month[4]=31,month[5]=30,month[6]=31,month[7]=31,month[8]=30,month[9]=31,month[10]=30,month[11]=31;
for(i=0;i<5;i++)
{
scanf("%d %d %d\n",&year,&mon,&day);
aaa[i][0]=year;
aaa[i][1]=mon;
aaa[i][2]=day;
}
for(i=0;i<5;i++)
{
year=aaa[i][0];
mon=aaa[i][1];
day=aaa[i][2];
if((year % 4 == 0 && year % 100 !=0 ) || year % 400 == 0)
month[1]=29;
else month[1]=28;
n=0;
for(m=0;m<(mon-1);m++)
{
n=n+month[m];
}
n=n+day;
printf("%d\n",n);
}
} |
11 | 5040 |
int shirunnian(int d)
{
if(d%4==0)
{
if(d%100==0)
{
if(d%400==0)
return 1;
else return 0;
}
else return 1;
}
else return 0;
}
int dijitian(int a,int b,int c)
{
int i;
int sum=0;
int days=0;
for(i=0;i<b;i++)
{
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12)
days+=31;
else if(i==4||i==6||i==9||i==11)
days+=30;
else if(i==2)
{
if(shirunnian(a)==1)
{
days+=29;
}
else if(shirunnian(a)==0)
{
days+=28;
}
}
}
sum=days+c;
return sum;
}
int main()
{
int year,month,day,tianshu=0;
scanf("%d%d%d", &year,&month,&day);
tianshu=dijitian(year,month,day);
printf("%d",tianshu);
return 0;
} |
11 | 5041 | int main()
{
int a,b,c,s=0,d=0;
int i;
scanf("%d %d %d",&a,&b,&c);
if(((a%4==0)&&((a%100)!=0))||((a%400)==0))
{
d=1;
}
for(i=1;i<b;i++)
{
if((i==1)||(i==3)||(i==5)||(i==7)||(i==8)||(i==10)||(i==12))
{
s=s+31;
}
if((i==4)||(i==6)||(i==9)||(i==11))
{
s=s+30;
}
if(i==2)
{
if(d==0)
{
s=s+28;
}
if(d==1)
{
s=s+29;
}
}
}
s=s+c;
printf("%d",s);
return 0;
}
|
11 | 5042 |
int main()
{
int y,m,d,s,er;
scanf("%d %d %d",&y,&m,&d);
if(y%400==0)
{
er=29;
switch(m)
{
case 1:s=d;printf("%d\n",s);break;
case 2:s=31+d;printf("%d\n",s);break;
case 3:s=31+er+d;printf("%d\n",s);break;
case 4:s=31*2+er+d;printf("%d\n",s);break;
case 5:s=31*2+er+30+d;printf("%d\n",s);break;
case 6:s=31*3+er+30+d;printf("%d\n",s);break;
case 7:s=31*3+er+30*2+d;printf("%d\n",s);break;
case 8:s=31*4+er+30*2+d;printf("%d\n",s);break;
case 9:s=31*5+er+30*2+d;printf("%d\n",s);break;
case 10:s=31*5+er+30*3+d;printf("%d\n",s);break;
case 11:s=31*6+er+30*3+d;printf("%d\n",s);break;
case 12:s=31*6+er+30*4+d;printf("%d\n",s);
}
}
else
{
er=28;
switch(m)
{
case 1:s=d;printf("%d\n",s);break;
case 2:s=31+d;printf("%d\n",s);break;
case 3:s=31+er+d;printf("%d\n",s);break;
case 4:s=31*2+er+d;printf("%d\n",s);break;
case 5:s=31*2+er+30+d;printf("%d\n",s);break;
case 6:s=31*3+er+30+d;printf("%d\n",s);break;
case 7:s=31*3+er+30*2+d;printf("%d\n",s);break;
case 8:s=31*4+er+30*2+d;printf("%d\n",s);break;
case 9:s=31*5+er+30*2+d;printf("%d\n",s);break;
case 10:s=31*5+er+30*3+d;printf("%d\n",s);break;
case 11:s=31*6+er+30*3+d;printf("%d\n",s);break;
case 12:s=31*6+er+30*4+d;printf("%d\n",s);
}
}
return 0;
} |
11 | 5043 | int main()
{
int year,month,day,result=0,i;
scanf("%d%d%d",&year,&month,&day);
for(i=1;i<month;i++)
{
if(i==1||i==3||i==5||i==7||i==8||i==10){
result+=31;
}
else if(i==4||i==6||i==9||i==11){
result+=30;
}
else if(i==2){
if(year%400==0||(year%4==0&&year%100!=0)){
result+=29;
}
else
result+=28;
}
}
result+=day;
printf("%d",result);
return 0;
} |
11 | 5044 | int main()
{
int y,m,d,i,x=0;
int mon[12]={31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d%d%d",&y,&m,&d);
if(y%4==0&&y%100!=0)
{
mon[1]=29;
}
else if(y%400==0)
{
mon[1]=29;
}
else
mon[1]=28;
for(i=0;i<m-1;i++)
{
x+=mon[i];
}
x=x+d;
printf("%d\n",x);
return 0;
} |
11 | 5045 | int main()
{
int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int year,month,day;
int isleapyear;
scanf("%d%d%d",&year,&month,&day);
isleapyear=(year%4==0&&year%100!=0)||year%400==0;
if (isleapyear&& month == 2 && (day < 1 || day > 29))
{
printf("Illegal input.\n");
return -1;
}
if (isleapyear&& month != 2 && (day < 1 || day > days[month]))
{
printf("Illegal input.\n");
return -1;
}
if (!isleapyear&& (day < 1 || day > days[month]))
{
printf("Illegal input.\n");
return -1;
}
int n=0;
int i;
for(i=0;i<month;i++)
{
n+=days[i];
}
n+=day;
if(month>2&&isleapyear)
n++;
printf("%d",n);
return 0;
}
|
11 | 5046 | int main()
{
int y,m,d,s=0;
scanf("%d %d %d",&y,&m,&d);
if(m==1) s=d;
else if(m==2) s=31+d;
else if(m==3) s=60+d;
else if(m==4) s=91+d;
else if(m==5) s=121+d;
else if(m==6) s=152+d;
else if(m==7) s=182+d;
else if(m==8) s=213+d;
else if(m==9) s=244+d;
else if(m==10) s=274+d;
else if(m==11) s=305+d;
else if(m==12) s=335+d;
if(m>=3)
{
if(y%100==0)
{
if(y%400==0)
{
printf("%d",s);
}
else
printf("%d",s-1);
}
else if(y%4==0)
printf("%d",s);
else if(y%4!=0)
printf("%d",s-1);
}
else
printf("%d",s);
return 0;
}
|
11 | 5047 | int main(){
int y,m,d,i,D;
int p[12]={31,28,31,30,31,30,31,31,30,31,30,31};
D=0;
scanf("%d%d%d",&y,&m,&d);
if(((y%4==0)&&(y%100!=0))||((y%400)==0)){
for(i=0;i<m-1;i++){
D=D+p[i];
}
D=D+d+1;
printf("%d",D);
}
else{
for(i=0;i<m-1;i++){
D=D+p[i];
}
D=D+d;
printf("%d",D);
}
return 0;
}
|
11 | 5048 | int main()
{
int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int year,month,day,i,num=0;
scanf("%d%d%d",&year,&month,&day);
if(year%4==0)
{
if(year%100==0&&year%400!=0)
a[2]=28;
else if(year%400==0)
a[2]=29;
else a[2]=29;
}
else a[2]=28;
for(i=1;i<month;i++)
num=num+a[i];
num=num+day;
printf("%d",num);
return 0;
} |
11 | 5049 | int main(int argc, char* argv[])
{
int year, month, date;
int m=0,n=0;
scanf("%d %d %d", &year, &month, &date);
if (month==1)
{
n=date;
}
m=m+31;
if (month==2)
{
n=m+date;
}
if ((year%4==0&&year%100!=0)||(year%400==0))
{
m=m+29;
}
else
{
m=m+28;
}
if (month==3)
{
n=m+date;
}
m=m+31;
if (month==4)
{
n=m+date;
}
m=m+30;
if (month==5)
{
n=m+date;
}
m=m+31;
if (month==6)
{
n=m+date;
}
m=m+30;
if (month==7)
{
n=m+date;
}
m=m+31;
if (month==8)
{
n=m+date;
}
m=m+31;
if (month==9)
{
n=m+date;
}
m=m+30;
if (month==10)
{
n=m+date;
}
m=m+31;
if (month==11)
{
n=m+date;
}
m=m+30;
if (month==12)
{
n=m+date;
}
printf("%d\n", n);
return 0;
} |
11 | 5050 |
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if (b==1)
{
printf("%d",c);
}
if((a%4==0)&&(a%100==0)&&(a%400==0))
{
switch (b)
{
case 2 :
{
printf("%d",31+c);
break;
}
case 3:
{
printf("%d",31+29+c);
break;
}
case 4:
{
printf("%d",31+29+31+c);
break;
}
case 5:
{
printf("%d",31+29+31+30+c);
break;
}
case 6:
{
printf("%d",31+29+31+30+31+c);
break;
}
case 7:
{
printf("%d",31+29+31+30+31+30+c);
break;
}
case 8:
{
printf("%d",31+29+31+30+31+30+31+c);
break;
}
case 9:
{
printf("%d",31+29+31+30+31+30+31+31+c);
break;
}
case 10:
{
printf("%d",31+29+31+30+31+30+31+31+30+c);
break;
}
case 11:
{
printf("%d",31+29+31+30+31+30+31+31+30+31+c);
break;
}
case 12:
{
printf("%d",31+29+31+30+31+30+31+31+30+31+30+c);
break;
}
}
}
else
{
switch(b)
{
case 2:
{
printf("%d",31+c);
break;
}
case 3:
{
printf("%d",31+28+c);
break;
}
case 4:
{
printf("%d",31+28+31+c);
break;
}
case 5:
{
printf("%d",31+28+31+30+c);
break;
}
case 6:
{
printf("%d",31+28+31+30+31+c);
break;
}
case 7:
{
printf("%d",31+28+31+30+31+30+c);
break;
}
case 8:
{
printf("%d",31+28+31+30+31+30+31+c);
break;
}
case 9:
{
printf("%d",31+28+31+30+31+30+31+31+c);
break;
}
case 10:
{
printf("%d",31+28+31+30+31+30+31+31+30+c);
break;
}
case 11:
{
printf("%d",31+28+31+30+31+30+31+31+30+31+c);
break;
}
case 12:
{
printf("%d",31+28+31+30+31+30+31+31+30+31+30+c);
break;
}
}
}
return 0;
} |
11 | 5051 | main()
{
int year,mon,day,f,i,sum=0;
int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d %d %d",&year,&mon,&day);
if(year%4==0&&year%100!=0)
f=1;
else if(year%400==0)
f=1;
else
f=0;
for(i=1;i<mon;i++)
{
sum=sum+a[i-1];
}
sum=sum+day;
if(f==1&&mon>2)
sum=sum+1;
printf("%d",sum);
getchar();
getchar();
}
|
11 | 5052 | int main()
{
int year,month,day;
int monthday[12]={31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d%d%d",&year,&month,&day);
int i,j;
int sum=0;
for(i=1;i<month;i++)
{
j=i-1;
sum=sum+monthday[j];
}
sum=sum+day;
int a;
a=year%4;
if(month>2&&(a==0&&year%100!=0||year%400==0))
{
sum=sum+1;
}
printf("%d",sum);
return 0;
}
|
11 | 5053 |
int days_of_month[2][12] = {{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
{31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
int is_leap_year(int year)
{
if(year%100!=0 && year%4==0 || year%400==0)
return 1;
else
return 0;
}
int main()
{
int year, month, day;
scanf("%d%d%d", &year, &month, &day);
int index = is_leap_year(year);
int days = 0;
for(int i=0; i<month-1; i++)
days += days_of_month[index][i];
days += day;
printf("%d", days);
} |
11 | 5054 | int main()
{
int a,b,c=0;
int i=0;
int sum=0;
scanf("%d %d %d",&a,&b,&c);
for(i=1;i<b;i++)
{
sum=sum+30;
if(i==1||i==3||i==5||i==7||i==8||i==10)
{
sum=sum+1;
}
else if(i==2&&((a%100!=0&&a%4==0)||a%400==0))
{
sum=sum-1;
}
else if(i==2&&(a%4!=0||a%100==0&&a%400!=0))
{
sum=sum-2;
}
}
printf("%d",sum+c);
return 0;
}
|
11 | 5055 | int main(int argc, char* argv[])
{
int year,month,day;
int real;
scanf("%d%d%d",&year,&month,&day);
if((year%4==0 && year%100!=0) || (year%400==0))
{
if(month==1)
{
printf("%d",day);
}
if(month==2)
{
real=31+day;
printf("%d",real);
}
if(month==3)
{
real=31+29+day;
printf("%d",real);
}
if(month==4)
{
real=31+29+31+day;
printf("%d",real);
}
if(month==5)
{
real=31*2+30+29+day;
printf("%d",real);
}
if(month==6)
{
real=31*3+30+29+day;
printf("%d",real);
}
if(month==7)
{
real=31*3+30*2+29+day;
printf("%d",real);
}
if(month==8)
{
real=31*4+30*2+29+day;
printf("%d",real);
}
if(month==9)
{
real=31*5+30*2+29+day;
printf("%d",real);
}
if(month==10)
{
real=31*5+30*3+29+day;
printf("%d",real);
}
if(month==11)
{
real=31*6+30*3+29+day;
printf("%d",real);
}
if(month==12)
{
real=31*6+30*4+29+day;
printf("%d",real);
}
}
else
{
if(month==1)
{
printf("%d",day);
}
if(month==2)
{
real=31+day;
printf("%d",real);
}
if(month==3)
{
real=31+28+day;
printf("%d",real);
}
if(month==4)
{
real=31+28+31+day;
printf("%d",real);
}
if(month==5)
{
real=31*2+30+28+day;
printf("%d",real);
}
if(month==6)
{
real=31*3+30+28+day;
printf("%d",real);
}
if(month==7)
{
real=31*3+30*2+28+day;
printf("%d",real);
}
if(month==8)
{
real=31*4+30*2+28+day;
printf("%d",real);
}
if(month==9)
{
real=31*5+30*2+28+day;
printf("%d",real);
}
if(month==10)
{
real=31*5+30*3+28+day;
printf("%d",real);
}
if(month==11)
{
real=31*6+30*3+28+day;
printf("%d",real);
}
if(month==12)
{
real=31*6+30*4+28+day;
printf("%d",real);
}
}
return 0;
} |
11 | 5056 | int main()
{
int a,b,c,n,s[12],i,t;
scanf ("%d %d %d",&a,&b,&c);
s[0]=31;
s[2]=31;
s[3]=30;
s[4]=31;
s[5]=30;
s[6]=31;
s[7]=31;
s[8]=30;
s[9]=31;
s[10]=30;
s[11]=31;
t=0;
for(i=0;i<b-1;i++)
{
if ((a%4==0&&a%100!=0)||a%400==0)
{
s[1]=29;
t=s[i]+t;
}
else
{
s[1]=28;
t=s[i]+t;
}
}
n=t+c;
printf("%d\n",n);
return 0;
}
|
11 | 5057 | int main()
{
int year,month,day,n;
scanf("%d%d%d",&year,&month,&day);
switch(month)
{
case 1:
{
n=day;
break;
}
case 2:
{
n=31+day;
break;
}
case 3:
{
n=59+day;
if( (year%4==0&&year%100!=0) || (year%400==0) )
{
n=n+1;
}
else
{
n=n;
}
break;
}
case 4:
{
n=90+day;
break;
}
case 5:
{
n=120+day;
break;
}
case 6:
{
n=151+day;
break;
}
case 7:
{
n=181+day;
break;
}
case 8:
{
n=212+day;
break;
}
case 9:
{
n=243+day;
break;
}
case 10:
{
n=273+day;
break;
}
case 11:
{
n=304+day;
break;
}
case 12:
{
n=334+day;
break;
}
}
printf("%d\n",n);
return 0;
} |
11 | 5058 | main()
{
int a[12],b[100000],c,d,e,i,s,t=0;
scanf("%d %d %d\n",&c,&d,&e);
if(c%4!=0 || (c%100==0 && c%400!=0))
{
a[0]=31;
a[1]=28;
a[2]=31;
a[3]=30;
a[4]=31;
a[5]=30;
a[6]=31;
a[7]=31;
a[8]=30;
a[9]=31;
a[10]=30;
a[11]=31;
for(i=0;i<d-1;i++)
t=t+a[i];
s=t+e;
}
else
{
a[0]=31;
a[1]=29;
a[2]=31;
a[3]=30;
a[4]=31;
a[5]=30;
a[6]=31;
a[7]=31;
a[8]=30;
a[9]=31;
a[10]=30;
a[11]=31;
for(i=0;i<d-1;i++)
t=t+a[i];
s=t+e;
}
printf("%d",s);
getchar();
getchar();
}
|
11 | 5059 | int main()
{
int year,month,day;
int Sn=0;
int i=0;
scanf("%d%d%d",&year,&month,&day);
if(year%4==0&&year%100!=0||year%400==0)
{
int months[12]={31,29,31,30,31,30,31,31,30,31,30,31};
while(i<month-1)
{
Sn=Sn+months[i];
i++;
}
Sn=Sn+day;
}
else
{
int months[12]={31,28,31,30,31,30,31,31,30,31,30,31};
while(i<month-1)
{
Sn=Sn+months[i];
i++;
}
Sn=Sn+day;
}
printf("%d",Sn);
return 0;
} |
11 | 5060 |
int main()
{
int year,month,day,days,i;
scanf("%d%d%d",&year,&month,&day);
if(year%4==0&&year%100==!0)
{
switch(month)
{
case 1:days=day;
break;
case 2:days=31+day;
break;
case 3:days=31+29+day;
break;
case 4:days=31+29+31+day;
break;
case 5:days=31+29+31+30+day;
break;
case 6:days=31+31+29+31+30+day;
break;
case 7:days=30+31+31+29+31+30+day;
break;
case 8:days=31+30+31+31+29+31+30+day;
break;
case 9:days=31+31+30+31+31+29+31+30+day;
break;
case 10:days=30+31+31+30+31+31+29+31+30+day;
break;
case 11:days=31+30+31+31+30+31+31+29+31+30+day;
break;
case 12:days=30+31+30+31+31+30+31+31+29+31+30+day;
default:
;
}
}
else
{
switch(month)
{
case 1:days=day;
break;
case 2:days=31+day;
break;
case 3:days=31+28+day;
break;
case 4:days=31+28+31+day;
break;
case 5:days=31+28+31+30+day;
break;
case 6:days=31+31+28+31+30+day;
break;
case 7:days=30+31+31+28+31+30+day;
break;
case 8:days=31+30+31+31+28+31+30+day;
break;
case 9:days=31+31+30+31+31+28+31+30+day;
break;
case 10:days=30+31+31+30+31+31+28+31+30+day;
break;
case 11:days=31+30+31+31+30+31+31+28+31+30+day;
break;
case 12:days=30+31+30+31+31+30+31+31+28+31+30+day;
default:
;
}
}
printf("%d",days);
return 0;
} |
11 | 5061 | int main()
{
int i,j,k,m,n;
scanf("%d%d%d",&i,&j,&k);
if((i%4==0&&i%100!=0)||(i%100==0&&i%400==0))
{
if(j==1)
{
m=k;
printf("%d",m);
}
if(j==2)
{
m=k+31;
printf("%d",m);
}
if(j==3)
{
m=k+60;
printf("%d",m);
}
if(j==4)
{
m=k+91;
printf("%d",m);
}
if(j==5)
{
m=k+121;
printf("%d",m);
}
if(j==6)
{
m=k+152;
printf("%d",m);
}
if(j==7)
{
m=k+182;
printf("%d",m);
}
if(j==8)
{
m=k+213;
printf("%d",m);
}
if(j==9)
{
m=k+244;
printf("%d",m);
}
if(j==10)
{
m=k+274;
printf("%d",m);
}
if(j==11)
{
m=k+305;
printf("%d",m);
}
if(j==12)
{
m=k+335;
printf("%d",m);
}
}
else
{
if(j==1)
{
m=k;
printf("%d",m);
}
if(j==2)
{
m=k+31;
printf("%d",m);
}
if(j==3)
{
m=k+59;
printf("%d",m);
}
if(j==4)
{
m=k+90;
printf("%d",m);
}
if(j==5)
{
m=k+120;
printf("%d",m);
}
if(j==6)
{
m=k+151;
printf("%d",m);
}
if(j==7)
{
m=k+181;
printf("%d",m);
}
if(j==8)
{
m=k+212;
printf("%d",m);
}
if(j==9)
{
m=k+243;
printf("%d",m);
}
if(j==10)
{
m=k+273;
printf("%d",m);
}
if(j==11)
{
m=k+304;
printf("%d",m);
}
if(j==12)
{
m=k+334;
printf("%d",m);
}
}
}
|
11 | 5062 | int Year(int a)
{
if(a%100==0)
{
if(a%400==0)
{
return 1;
}
else
return 0;
}
else if(a%4==0)
{
return 1;
}
else
return 0;
}
int main()
{
int year,month,day,a[13],i,answer;
cin >>year>>month>>day;
for(i=1;i<=12;i++)
{
switch(i)
{
case 1:
case 3:
case 5:
case 7:
case 8:
case 10:
case 12:
a[i]=31;break;
case 4:
case 6:
case 9:
case 11:
a[i]=30;break;
case 2:
if(Year(year)==1)
{
a[i]=29;
break;
}
else
{
a[i]=28;
break;
}
}
}
answer=0;
for(i=1;i<month;i++)
{
answer+=a[i];
}
answer+=day;
cout <<answer<<endl;
return 0;
}
|
11 | 5063 | int main()
{
int n,y,r,b[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int c[13]={0,31,28,31,30,31,30,31,31,30,31,30,31},i,sum=0,q;
cin>>n>>y>>r;
if(n%400==0||(n%4==0&&n%100!=0))
{
for(i=1;i<=y-1;i++)
sum=sum+b[i];
sum=sum+r;
cout<<sum;
}
else
{
for(i=1;i<=y-1;i++)
sum=sum+c[i];
sum=sum+r;
cout<<sum;
}
cin>>q;
return 0;
}
|
11 | 5064 | int main()
{
int a,b,c,d;
scanf("%d%d%d",&a,&b,&c);
if(a%4==0&&a%100!=0||a%400==0)
{ switch(b)
{ case 1:
{d=c;
break;}
case 2:
{d=31+c;
break;}
case 3:
{d=31+29+c;
break;}
case 4:
{d=31+29+31+c;
break;}
case 5:
{d=31+29+31+30+c;
break;}
case 6:
{d=31+29+31+30+31+c;
break;}
case 7:
{d=31+29+31+30+31+30+c;
break;}
case 8:
{d=31+29+31+30+31+30+31+c;
break;}
case 9:
{d=31+29+31+30+31+30+31+31+c;
break;}
case 10:
{d=31+29+31+30+31+30+31+31+30+c;
break;}
case 11:
{d=31+29+31+30+31+30+31+31+30+31+c;
break;}
case 12:
{d=31+29+31+30+31+30+31+31+30+31+30+c;
break;}
}
printf("%d",d);
}
else
{ switch(b)
{ case 1:
{d=c;
break;}
case 2:
{d=31+c;
break;}
case 3:
{d=31+28+c;
break;}
case 4:
{d=31+28+31+c;
break;}
case 5:
{d=31+28+31+30+c;
break;}
case 6:
{d=31+28+31+30+31+c;
break;}
case 7:
{d=31+28+31+30+31+30+c;
break;}
case 8:
{d=31+28+31+30+31+30+31+c;
break;}
case 9:
{d=31+28+31+30+31+30+31+31+c;
break;}
case 10:
{d=31+28+31+30+31+30+31+31+30+c;
break;}
case 11:
{d=31+28+31+30+31+30+31+31+30+31+c;
break;}
case 12:
{d=31+28+31+30+31+30+31+31+30+31+30+c;
break;}
}
printf("%d",d);
}
return 0;
}
|
11 | 5065 | int main()
{
int y,m,d,i,sum;
int a[12]={31,0,31,30,31,30,31,31,30,31,30,31};
scanf("%d %d %d",&y,&m,&d);
if((y%4==0&&y%100!=0 )|| y%400 == 0)
a[1]=29;
else
a[1]=28;
sum=0;
for(i=0;i<m;i++)
sum = sum+a[i];
sum = sum-a[i-1]+d;
printf("%d",sum);
getchar();
getchar();
return 0;
}
|
11 | 5066 | int main()
{
int a,b,c,d,e;
scanf("%d%d%d",&a,&b,&c);
if((a%4==0&&a%100!=0)||(a%400==0))
d=29;
else
d=28;
switch(b){
case 1:
e=c;
break;
case 2:
e=31+c;
break;
case 3:
e=31+d+c;
break;
case 4:
e=62+d+c;
break;
case 5:
e=92+d+c;
break;
case 6:
e=123+d+c;
break;
case 7:
e=153+d+c;
break;
case 8:
e=184+d+c;
break;
case 9:
e=215+d+c;
break;
case 10:
e=245+d+c;
break;
case 11:
e=276+d+c;
break;
case 12:
e=306+d+c;
break;
}
printf("%d",e);
return 0;
}
|
11 | 5067 | int main(int argc, char* argv[])
{
int year,month,days;
scanf("%d %d %d",&year,&month,&days);
int day;
if(month==1)
{
day=days;
}
if(month==2)
{
day=31+days;
}
if(month==3)
{
if((year%400==0)||(year%4==0&&year%100!=0))
day=31+29+days;
else
day=31+28+days;
}
if(month==4)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+days;
else
day=31+28+31+days;
}
if(month==5)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+30+days;
else
day=31+28+31+30+days;
}
if(month==6)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+30+31+31+days;
else
day=31+28+30+31+31+days;
}
if(month==7)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+30+31+30+days;
else
day=31+28+31+30+31+30+days;
}
if(month==8)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+30+31+30+31+days;
else
day=31+28+31+30+31+30+31+days;
}
if(month==9)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+30+31+30+31+31+days;
else
day=31+28+31+30+31+30+31+31+days;
}
if(month==10)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+30+31+30+31+31+30+days;
else
day=31+28+31+30+31+30+31+31+30+days;
}
if(month==11)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+30+31+30+31+31+30+31+days;
else
day=31+28+31+30+31+30+31+31+30+31+days;
}
if(month==12)
{
if((year%4==0&&year%100!=0)||(year%400==0))
day=31+29+31+30+31+30+31+31+30+31+30+days;
else
day=31+28+31+30+31+30+31+31+30+31+30+days;
}
printf("%d\n",day);
return 0;
}
|
11 | 5068 | int main()
{
int y,m,d,daysum=0;
cin>>y>>m>>d;
int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int dayleap[13]={0,31,29,31,30,31,30,31,31,30,31,30,31} ;
if((y%4!=0)||((y%100==0)&&(y%400!=0)))
{
for(int i=0;i<m;i++)
daysum += day[i];
daysum += d;
}
else
{
for(int i=0;i<m;i++)
daysum += dayleap[i];
daysum += d;
}
cout<<daysum;
return 0;
}
|
11 | 5069 |
int main()
{
struct time
{
int year;
int month;
int date;
int dayoftheyear;
} nn;
scanf("%d%d%d",&nn.year,&nn.month,&nn.date);
if(((nn.year%4==0)&&(nn.year%100==0))||(nn.year%400==0))
{
switch(nn.month){
case 1:
nn.dayoftheyear=nn.date;
break;
case 2:
nn.dayoftheyear=nn.date+jan;
break;
case 3:
nn.dayoftheyear=nn.date+jan+feb+1;
break;
case 4:
nn.dayoftheyear=nn.date+jan+feb+mar+1;
break;
case 5:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+1;
break;
case 6:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+1;
break;
case 7:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+1;
break;
case 8:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+1;
break;
case 9:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug+1;
break;
case 10:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug+sep+1;
break;
case 11:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug+sep+oct+1;
break;
case 12:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug+sep+oct+nov+1;
break;
}
}
else
{
switch(nn.month){
case 1:
nn.dayoftheyear=nn.date;
break;
case 2:
nn.dayoftheyear=nn.date+jan;
break;
case 3:
nn.dayoftheyear=nn.date+jan+feb;
break;
case 4:
nn.dayoftheyear=nn.date+jan+feb+mar;
break;
case 5:
nn.dayoftheyear=nn.date+jan+feb+mar+apr;
break;
case 6:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may;
break;
case 7:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun;
break;
case 8:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul;
break;
case 9:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug;
break;
case 10:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug+sep;
break;
case 11:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug+sep+oct;
break;
case 12:
nn.dayoftheyear=nn.date+jan+feb+mar+apr+may+jun+jul+aug+sep+oct+nov;
break;
}
}
printf("%d\n",nn.dayoftheyear);
return 0;
} |
11 | 5070 | int main()
{
int a,m,day,i,x;
cin >> a >> m >> day;
switch(m)
{
case 1:i=0;break;
case 2:i=31;break;
case 3:i=31+28;break;
case 4:i=31+28+31;break;
case 5:i=31+28+31+30;break;
case 6:i=31+28+31+30+31;break;
case 7:i=31+28+31+30+31+30;break;
case 8:i=31+28+31+30+31+30+31;break;
case 9:i=31+28+31+30+31+30+31+31;break;
case 10:i=31+28+31+30+31+30+31+31+30;break;
case 11:i=31+28+31+30+31+30+31+31+30+31;break;
case 12:i=31+28+31+30+31+30+31+31+30+31+30;break;
default:cout << "error" <<endl;
}
if ( (a%4==0 && a%100!=0) || (a%400==0) )
{
if ((m!=1)&&(m!=2))
x=i+day+1;
else
x=i+day;
}
else
x=i+day;
cout << x << endl;
return 0;
}
|
11 | 5071 | int main(int argc, char* argv[])
{
int a,b,c,i,s[13],t,n;
s[0]=0;s[1]=31;s[3]=31;s[4]=30;s[5]=31;s[6]=30;s[7]=31;s[8]=31;s[9]=30;s[10]=31;s[11]=30;s[12]=31;
t=0;
scanf("%d %d %d",&a,&b,&c);
for(i=1;i<b;i++)
{
if(a%4==0&&a%100!=0||a%400==0)
{
s[2]=29;
t=s[i]+t;
}
else
{s[2]=28;
t=s[i]+t;
}
}
n=t+c;
printf("%d\n",n);
return 0;
} |
11 | 5072 |
long total;
int run(int n)
{
if (n%4==0 && n%100!=0)
{
return 1;
}
if (n%400==0)
{
return 1;
}
return 0;
}
int main()
{
int year,month,day;
int i;
while (cin>>year>>month>>day)
{
total=0;
if (run(year))
{
if (month==1)
{
total+=day;
}
if (month==2)
{
total+=31+day;
}
switch (month)
{
case 3:total+=60+day;break;
case 4:total+=91+day;break;
case 5:total+=121+day;break;
case 6:total+=152+day;break;
case 7:total+=182+day;break;
case 8:total+=213+day;break;
case 9:total+=244+day;break;
case 10:total+=274+day;break;
case 11:total+=305+day;break;
case 12:total+=335+day;break;
}
}
else
{
if (month==1)
{
total+=day;
}
if (month==2)
{
total+=31+day;
}
switch (month)
{
case 3:total+=59+day;break;
case 4:total+=90+day;break;
case 5:total+=120+day;break;
case 6:total+=151+day;break;
case 7:total+=181+day;break;
case 8:total+=212+day;break;
case 9:total+=243+day;break;
case 10:total+=273+day;break;
case 11:total+=304+day;break;
case 12:total+=334+day;break;
}
}
cout<<total<<endl;
}
return 0;
}
|
11 | 5073 |
int main(int argc, char* argv[])
{
int year,mon,day,i;
int total=0;
scanf("%d%d%d",&year,&mon,&day);
if (year % 4 == 0 && year % 100 !=0 || year % 400 ==0){
int a[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
for(i=0;i<mon;i++){
total=total+a[i];
}
}
else {
int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
for(i=0;i<mon;i++){
total=total+a[i];
}
}
total+=day;
printf("%d",total);
return 0;
}
|
11 | 5074 |
int main()
{
int yy,mm,dd,i,n=0;
scanf("%d%d%d",&yy,&mm,&dd);
if(yy%4==0&&yy%100!=0||yy%400==0)
{
for(i=1;i<mm;i++)
{
switch(i)
{
case 1:
n=n+31;
break;
case 2:
n=n+29;
break;
case 3:
n=n+31;
break;
case 4:
n=n+30;
break;
case 5:
n=n+31;
break;
case 6:
n=n+30;
break;
case 7:
n=n+31;
break;
case 8:
n=n+31;
break;
case 9:
n=n+30;
break;
case 10:
n=n+31;
break;
case 11:
n=n+30;
break;
case 12:
n=n+31;
break;
}
}
n=n+dd;
printf("%d",n);
}
else
{
for(i=1;i<mm;i++)
{
switch(i)
{
case 1:
n=n+31;
break;
case 2:
n=n+28;
break;
case 3:
n=n+31;
break;
case 4:
n=n+30;
break;
case 5:
n=n+31;
break;
case 6:
n=n+30;
break;
case 7:
n=n+31;
break;
case 8:
n=n+31;
break;
case 9:
n=n+30;
break;
case 10:
n=n+31;
break;
case 11:
n=n+30;
break;
case 12:
n=n+31;
break;
}
}
n=n+dd;
printf("%d",n);
}
return 0;
}
|
11 | 5075 | int main(int argc, char* argv[])
{
int m,n,p,a;
scanf("%d%d%d",&m,&n,&p);
if (m%4!=0||(m%100==0&&m%400!=0))
{
if(n==1)
{
a=p;
}
else if ((n+1)%2==0&&(n+1)>9)
{
a=61*(n-1)/2-1+p;
}
else if((n-1)%2==0&&(n+1)<9)
{
a=61*(n-1)/2-2+p;
}
else if(n==2)
{
a=31+p;
}
else
{
a=61*(n-2)/2+29+p;
}
}
else
{
if((n-1)%2==0&&(n+1)<9)
{
a=61*(n-1)/2-1+p;
}
else if ((n+1)%2==0&&(n+1)>9)
{
a=61*(n-1)/2+p;
}
else if(n==1)
{
a=p;
}
else if(n==2)
{
a=31+p;
}
else
{
a=61*(n-2)/2+30+p;
}
}
printf("%d",a);
return 0;
}
|
11 | 5076 |
int runnian(int a)
{
if(a%4==0&&a%400==0)
return 1;
if(a%4==0&&a%100!=0)
return 1;
else return 0;
}
int tian(int nian,int yue,int ri)
{
int sum=0,i;
int run[12]={31,29,31,30,31,30,31,31,30,31,30,31};
int feirun[12]={31,28,31,30,31,30,31,31,30,31,30,31};
if(runnian(nian)==1)
{
for(i=0;i<=yue-2;i++)
sum+=run[i];
sum+=ri;
}
else
{
for(i=0;i<=yue-2;i++)
sum+=feirun[i];
sum+=ri;
}
return sum;
}
int main()
{
int nian,yue,ri;
cin>>nian>>yue>>ri;
cout<<tian(nian,yue,ri)<<endl;
return 0;
} |
11 | 5077 | int main()
{
int year,mon,day,n,leap;
scanf("%d %d %d",&year,&mon,&day);
if(year%4==0)
{
if(year%100==0)
{
if(year%400==0)
leap=1;
else
leap=0;
}
else
leap=1;
}
else
leap=0;
if(leap=0){
switch(mon)
{
case 1:n=day;break;
case 2:n=31+day;break;
case 3:n=31+29+day;break;
case 4:n=31+29+31+day;break;
case 5:n=31+29+31+30+day;break;
case 6:n=31+29+31+30+31+day;break;
case 7:n=31+29+31+30+31+30+day;break;
case 8:n=31+29+31+30+31+30+31+day;break;
case 9:n=31+29+31+30+31+30+31+31+day;break;
case 10:n=31+29+31+30+31+30+31+31+30+day;break;
case 11:n=31+29+31+30+31+30+31+31+30+31+day;break;
case 12:n=31+29+31+30+31+30+31+31+30+31+30+day;break;
}
printf("%d",n);
}
else
{
switch(mon)
{
case 1:n=day;break;
case 2:n=31+day;break;
case 3:n=31+28+day;break;
case 4:n=31+28+31+day;break;
case 5:n=31+28+31+30+day;break;
case 6:n=31+28+31+30+31+day;break;
case 7:n=31+28+31+30+31+30+day;break;
case 8:n=31+28+31+30+31+30+31+day;break;
case 9:n=31+28+31+30+31+30+31+31+day;break;
case 10:n=31+28+31+30+31+30+31+31+30+day;break;
case 11:n=31+28+31+30+31+30+31+31+30+31+day;break;
case 12:n=31+28+31+30+31+30+31+31+30+31+30+day;break;
}
printf("%d",n);
}
return 0;
}
|
11 | 5078 | int isrunnian(int year)
{
if(year%400==0)
return 1;
else if(year%4==0&&year%100!=0)
return 1;
else
return 0;
}
int main()
{
int y,m,d;
scanf("%d%d%d",&y,&m,&d);
if(m==1)
printf("%d\n",d);
else if(m==2)
printf("%d\n",31+d);
else if(m==3)
{
if(isrunnian(y))
printf("%d\n",31+29+d);
else
printf("%d\n",31+28+d);
}
else if(m==4)
{
if(isrunnian(y))
printf("%d\n",31+29+31+d);
else
printf("%d\n",31+28+31+d);
}
else if(m==5)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+d);
else
printf("%d\n",31+28+31+30+d);
}
else if(m==6)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+31+d);
else
printf("%d\n",31+28+30+31+31+d);
}
else if(m==7)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+31+30+d);
else
printf("%d\n",31+28+31+30+31+30+d);
}
else if(m==8)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+31+30+31+d);
else
printf("%d\n",31+28+31+30+31+30+31+d);
}
else if(m==9)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+31+30+31+31+d);
else
printf("%d\n",31+28+31+30+31+30+31+31+d);
}
else if(m==10)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+31+30+31+31+30+d);
else
printf("%d\n",31+28+31+30+31+30+31+31+30+d);
}
else if(m==11)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+31+30+31+31+30+31+d);
else
printf("%d\n",31+28+31+30+31+30+31+31+30+31+d);
}
else if(m==12)
{
if(isrunnian(y))
printf("%d\n",31+29+31+30+31+30+31+31+30+31+30+d);
else
printf("%d\n",31+28+31+30+31+30+31+31+30+31+30+d);
}
return 0;
} |
11 | 5079 | int leap(int y)
{
if (
(y%100==0)&&(y%400==0)
||
(y%100!=0)&&(y%4==0)
)
return 1; else return 0;
}
int days(int y,int d,int r)
{
int a[13]={0,0,31,28,31,30,31,30,31,31,30,31,30};
if (leap(y)) a[3]=29;
int ans=0;
for (int i=1;i<=d;i++) ans+=a[i];
return ans+r;
}
int main()
{
int y,d,r;
cin>>y>>d>>r;
//if (leapyear(y)) cout<<'N'; else cout<<'N';
cout<<days(y,d,r);
}
|
11 | 5080 | int main(int argc, char* argv[])
{
int year,m,d,result=0;
scanf ("%d%d%d",&year,&m,&d);
for (int i=1;i<m;i++){
if (i==1||i==3||i==5||i==7||i==8||i==10||i==12)
result+=31;
else if (i==2){
if (year%400==0||year%4==0&&year%100!=0)
result+=29;
else
result+=28;
}
else
result+=30;
}
result+=d;
printf ("%d\n",result);
return 0;
}
|
11 | 5081 |
// Provided the value of year, month and day,
// what day is it in this year?
// 1. January, 31 days
// 2. February, 28 days, 29 in leap years
// 3. March, 31 days
// 4. April, 30 days
// 5. May, 31 days
// 6. June, 30 days
// 7. July, 31 days
// 8. August, 31 days
// 9. September, 30 days
// 10. October, 31 days
// 11. November, 30 days
// 12. December, 31 days
static int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
// The Gregorian calendar, the current standard calendar in most of the world,
// adds a 29th day to February in all years evenly divisible by 4, except for
// centennial years (those ending in -00), which receive the extra day only if
// they are evenly divisible by 400.
static int isleapyear(int year) {
return (year % 4 == 0 && year % 100 !=0 ) || year % 400 == 0;
}
int main() {
int year, month, day;
int j;
for(j=0;j<5;j++){
int n = 0; // to store the result.
int i;
scanf("%d %d %d", &year, &month, &day);
// Check the input.
if (isleapyear(year) && month == 2 && (day < 1 || day > 29)) {
printf("Illegal input.\n");
return -1;
}
if (isleapyear(year) && month != 2 && (day < 1 || day > days[month])) {
printf("Illegal input.\n");
return -1;
}
if (!isleapyear(year) && (day < 1 || day > days[month])) {
printf("Illegal input.\n");
return -1;
}
// add days of former months.
for (i = 1; i < month; i++) {
n += days[i];
}
// add days of this month.
n += day;
// check leap year
if (month > 2 && isleapyear(year))
n++;
printf("%d\n", n);
}
return 0;
} |
11 | 5082 |
int main()
{
int A[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int B[12]={31,29,31,30,31,30,31,31,30,31,30,31};
int y,m,d,i;
scanf("%d%d%d",&y,&m,&d);
int s=d;
if((y%4==0&&y%100!=0)||(y%400==0))
{for(i=0;i<(m-1);i++)
{s+=B[i];
}
printf("%d",s);}
else
{for(i=0;i<(m-1);i++)
{
s+=A[i];
}
printf("%d",s);}
return 0;
}
|
11 | 5083 | int main()
{
int year,month,day,res=0,i;
int y[12];
scanf("%d %d %d",&year,&month,&day);
if(((year%4==0)&&(year%100!=0))||(year%400==0))
y[1]=29;
else
y[1]=28;
y[0]=31;
y[2]=31;
y[4]=31;
y[7]=31;
y[6]=31;
y[9]=31;
y[3]=30;
y[5]=30;
y[8]=30;
y[10]=30;
for(i=0;i<month-1;i++)
res+=y[i];
res+=day;
printf("%d",res);
} |
11 | 5084 |
int main(int argc, char* argv[])
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a%400==0||(a%4==0&&a%100!=0))
{
if(b==1)printf("%d\n",c);
else if(b==2)printf("%d\n",c+31);
else if(b==3)printf("%d\n",c+31+29);
else if(b==4)printf("%d\n",c+31+29+31);
else if(b==5)printf("%d\n",c+31+29+31+30);
else if(b==6)printf("%d\n",c+31+29+31+30+31);
else if(b==7)printf("%d\n",c+31+29+31+30+31+30);
else if(b==8)printf("%d\n",c+31+29+31+30+31+30+31);
else if(b==9)printf("%d\n",c+31+29+31+30+31+30+31+31);
else if(b==10)printf("%d\n",c+31+29+31+30+31+30+31+31+30);
else if(b==11)printf("%d\n",c+31+29+31+30+31+30+31+31+30+31);
else printf("%d\n",c+31+29+31+30+31+30+31+31+30+31+30);
}
else
{
if(b==1)printf("%d\n",c);
else if(b==2)printf("%d\n",c+31);
else if(b==3)printf("%d\n",c+31+28);
else if(b==4)printf("%d\n",c+31+28+31);
else if(b==5)printf("%d\n",c+31+28+31+30);
else if(b==6)printf("%d\n",c+31+28+31+30+31);
else if(b==7)printf("%d\n",c+31+28+31+30+31+30);
else if(b==8)printf("%d\n",c+31+28+31+30+31+30+31);
else if(b==9)printf("%d\n",c+31+28+31+30+31+30+31+31);
else if(b==10)printf("%d\n",c+31+28+31+30+31+30+31+31+30);
else if(b==11)printf("%d\n",c+31+28+31+30+31+30+31+31+30+31);
else printf("%d\n",c+31+28+31+30+31+30+31+31+30+31+30);
}
return 0;
}
|
11 | 5085 | int main()
{
int y,m,d,s;
scanf("%d%d%d",&y,&m,&d);
if(m==1)
{
s=d;
}
else if(m==2)
{
s=d+31;
}
else if(m==3)
{
s=d+59;
}
else if(m==4)
{
s=d+90;
}
else if(m==5)
{
s=d+120;
}
else if(m==6)
{
s=d+151;
}
else if(m==7)
{
s=d+181;
}
else if(m==8)
{
s=d+212;
}
else if(m==9)
{
s=d+243;
}
else if(m==10)
{
s=d+273;
}
else if(m==11)
{
s=d+304;
}
else
{
s=d+334;
}
if(!((y%400==0)||(y%100!=0&&y%4==0)))
{
printf("%d",s);
}
else
{
if(m<3)
{
printf("%d",s);
}
else
{
printf("%d",s+1);
}
}
return 0;
} |
11 | 5086 | int main()
{ int l,m,n,t,i,s;
scanf("%d%d%d",&l,&m,&n);
if(l%4==0&&l%100!=0)
t=29;
if(l%4!=0)
t=28;
if(l%100==0&&l%400!=0)
t=28;
if(l%400==0)
t=29;
int a[13]={0,31,t,31,30,31,30,31,31,30,31,30,31};
if(m==1)
s=n;
else
s=n;
for(i=1;i<m;i++)
{s=s+a[i];}
printf("%d",s);
return 0;
} |
11 | 5087 | int main()
{
int year,month,day,n=0,i,num=0;
int A[12]={31,28,31,30,31,30,31,31,30,31,30,31},
B[12]={31,29,31,30,31,30,31,31,30,31,30,31};
scanf("%d%d%d",&year,&month,&day);
if((year%4==0&&year%100!=0)||year%400==0)
{
for(i=0;i<month-1;i++)
{
n=n+B[i];
}
num=n+day;
printf("%d",num);
}
else
{
for(i=0;i<month-1;i++)
{
n=n+A[i];
}
num=n+day;
printf("%d",num);
}
return 0;
}
|
11 | 5088 | int main()
{
int a,b,c,d;
scanf("%d %d %d",&a,&b,&c);
if(a%400==0)
{
if(b==1)
d=c;
if(b==2)
d=31+c;
if(b==3)
d=60+c;
if(b==4)
d=91+c;
if(b==5)
d=121+c;
if(b==6)
d=152+c;
if(b==7)
d=182+c;
if(b==8)
d=213+c;
if(b==9)
d=244+c;
if(b==10)
d=275+c;
if(b==11)
d=305+c;
if(b==12)
d=335+c;
printf("%d",d);
}
else
{
if(a%4==0&&a%100!=0)
{
if(b==1)
d=c;
if(b==2)
d=31+c;
if(b==3)
d=60+c;
if(b==4)
d=91+c;
if(b==5)
d=121+c;
if(b==6)
d=152+c;
if(b==7)
d=182+c;
if(b==8)
d=213+c;
if(b==9)
d=244+c;
if(b==10)
d=275+c;
if(b==11)
d=305+c;
if(b==12)
d=335+c;
printf("%d",d);
}
else
{
if(b==1)
d=c;
if(b==2)
d=31+c;
if(b==3)
d=59+c;
if(b==4)
d=90+c;
if(b==5)
d=120+c;
if(b==6)
d=151+c;
if(b==7)
d=181+c;
if(b==8)
d=212+c;
if(b==9)
d=243+c;
if(b==10)
d=274+c;
if(b==11)
d=304+c;
if(b==12)
d=334+c;
printf("%d",d);
}
}
return 0;
}
|
11 | 5089 | int main()
{
int year,month,day,D;
scanf("%d%d%d",&year,&month,&day);
if(month==1)
{
D=day;
}
if(month==2)
{
D=day+31;
}
if((year%4==0)&&(year%100!=0)||(year%400==0))
{
if(month==3)
{
D=day+31+29;
}
if(month==4)
{
D=day+31+29+31;
}
if(month==5)
{
D=day+31+29+31+30;
}
if(month==6)
{
D=day+31+29+31+30+31;
}
if(month==7)
{
D=day+31+29+31+30+31+30;
}
if(month==8)
{
D=day+31+29+31+30+31+30+31;
}
if(month==9)
{
D=day+31+29+31+30+31+30+31+31;
}
if(month==10)
{
D=day+31+29+31+30+31+30+31+31+30;
}
if(month==11)
{
D=day+31+29+31+30+31+30+31+31+30+31;
}
if(month==12)
{
D=day+31+29+31+30+31+30+31+31+30+31+30;
}
}
else
{
if(month==3)
{
D=day+31+28;
}
if(month==4)
{
D=day+31+28+31;
}
if(month==5)
{
D=day+31+28+31+30;
}
if(month==6)
{
D=day+31+28+31+30+31;
}
if(month==7)
{
D=day+31+28+31+30+31+30;
}
if(month==8)
{
D=day+31+28+31+30+31+30+31;
}
if(month==9)
{
D=day+31+28+31+30+31+30+31+31;
}
if(month==10)
{
D=day+31+28+31+30+31+30+31+31+30;
}
if(month==11)
{
D=day+31+28+31+30+31+30+31+31+30+31;
}
if(month==12)
{
D=day+31+28+31+30+31+30+31+31+30+31+30;
}
}
printf("%d\n",D);
return 0;
}
|
11 | 5090 | int main ()
{
int year, month, day, num;
scanf("%d%d%d",&year,&month,&day);
if(year%4==0&&year%100!=0||year%400==0)
{
if(month==1)
{
num=day;
printf("%d\n",num);
}
if(month==2)
{
num=day+31;
printf("%d\n",num);
}
if(month==3)
{
num=day+31+29;
printf("%d\n",num);
}
if(month==4)
{
num=day+31+29+31;
printf("%d\n",num);
}
if(month==5)
{
num=day+31+29+31+30;
printf("%d\n",num);
}
if(month==6)
{
num=day+31+29+31+30+31;
printf("%d\n",num);
}
if(month==7)
{
num=day+31+29+31+30+31+30;
printf("%d\n",num);
}
if(month==8)
{
num=day+31+29+31+30+31+30+31;
printf("%d\n",num);
}
if(month==9)
{
num=day+31+29+31+30+31+30+31+31;
printf("%d\n",num);
}
if(month==10)
{
num=day+31+29+31+30+31+30+31+31+30;
printf("%d\n",num);
}
if(month==11)
{
num=day+31+29+31+30+31+30+31+31+30+31;
printf("%d\n",num);
}
if(month==12)
{
num=day+31+29+31+30+31+30+31+31+30+31+30;
printf("%d\n",num);
}
}
else
{
if(month==1)
{
num=day;
printf("%d\n",num);
}
if(month==2)
{
num=day+31;
printf("%d\n",num);
}
if(month==3)
{
num=day+31+28;
printf("%d\n",num);
}
if(month==4)
{
num=day+31+28+31;
printf("%d\n",num);
}
if(month==5)
{
num=day+31+28+31+30;
printf("%d\n",num);
}
if(month==6)
{
num=day+31+28+31+30+31;
printf("%d\n",num);
}
if(month==7)
{
num=day+31+28+31+30+31+30;
printf("%d\n",num);
}
if(month==8)
{
num=day+31+28+31+30+31+30+31;
printf("%d\n",num);
}
if(month==9)
{
num=day+31+28+31+30+31+30+31+31;
printf("%d\n",num);
}
if(month==10)
{
num=day+31+28+31+30+31+30+31+31+30;
printf("%d\n",num);
}
if(month==11)
{
num=day+31+28+31+30+31+30+31+31+30+31;
printf("%d\n",num);
}
if(month==12)
{
num=day+31+28+31+30+31+30+31+31+30+31+30;
printf("%d\n",num);
}
}
return 0;
} |
11 | 5091 | void main()
{
int i;
long a[5];
int b[5],c[5],g[5];
i=1;
while(i<=5)
{
scanf("%ld %d %d",&a[i],&b[i],&c[i]);
i++;
}
i=1;
while(i<=5)
{
g[i]=0;
switch(b[i])
{
case 12: g[i]+=30;
case 11: g[i]+=31;
case 10: g[i]+=30;
case 9: g[i]+=31;
case 8: g[i]+=31;
case 7: g[i]+=30;
case 6: g[i]+=31;
case 5: g[i]+=30;
case 4: g[i]+=31;
case 3: g[i]+=28;
case 2: g[i]+=31;
case 1: g[i]+=0;break;
default: printf("error\n");
}
if(((a[i]%4==0&&a[i]%100!=0)||(a[i]%400==0))&&(b[i]>=3))
c[i]=c[i]+1;
printf("%d\n",g[i]+c[i]);
i++;
}
} |
11 | 5092 | int main(int argc, char* argv[])
{
int year,month,day,month2,n;
scanf("%d %d %d",&year,&month,&day);
if (year%4==0&&year%100!=0||year%400==0)
month2=29;
else
month2=28;
if (month==1)
n=day;
if (month==2)
n=31+day;
if(month==3)
n=31+month2+day;
if(month==4)
n=31+month2+31+day;
if(month==5)
n=31+month2+31+30+day;
if(month==6)
n=31+month2+31+30+31+day;
if(month==7)
n=31+month2+31+30+31+30+day;
if(month==8)
n=31+month2+31+30+31+30+31+day;
if(month==9)
n=31+month2+31+30+31+30+31+31+day;
if(month==10)
n=31+month2+31+30+31+30+31+31+30+day;
if(month==11)
n=31+month2+31+30+31+30+31+31+30+31+day;
if(month==12)
n=31+month2+31+30+31+30+31+31+30+31+30+day;
printf("%d",n);
return 0;
}
|
11 | 5093 | int ping(int n)
{
if(n==1||n==3||n==5||n==7||n==8||n==10||n==12)
return 31;
if(n==2)
return 28;
if(n==4||n==6||n==9||n==11)
return 30;
}
int run(int n)
{
if(n==1||n==3||n==5||n==7||n==8||n==10||n==12)
return 31;
if(n==2)
return 29;
if(n==4||n==6||n==9||n==11)
return 30;
}
int main()
{
int n,month,day,sum=0;
cin>>n>>month>>day;
int i;
if((n%400==0)||(n%4==0&&n%100!=0))
{
for(i=1;i<month;i++)
sum+=run(i);
sum+=day;
cout<<sum;
}
else
{
for(i=1;i<month;i++)
sum+=ping(i);
sum+=day;
cout<<sum;
}
return 0;
} |
11 | 5094 |
// Provided the value of year, month and day,
// what day is it in this year?
// 1. January, 31 days
// 2. February, 28 days, 29 in leap years
// 3. March, 31 days
// 4. April, 30 days
// 5. May, 31 days
// 6. June, 30 days
// 7. July, 31 days
// 8. August, 31 days
// 9. September, 30 days
// 10. October, 31 days
// 11. November, 30 days
// 12. December, 31 days
static int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
// The Gregorian calendar, the current standard calendar in most of the world,
// adds a 29th day to February in all years evenly divisible by 4, except for
// centennial years (those ending in -00), which receive the extra day only if
// they are evenly divisible by 400.
static int isleapyear(int year) {
return (year % 4 == 0 && year % 100 !=0 ) || year % 400 == 0;
}
int main() {
int year, month, day;
scanf("%d %d %d", &year, &month, &day);
// Check the input.
if (isleapyear(year) && month == 2 && (day < 1 || day > 29)) {
printf("Illegal input.\n");
return -1;
}
if (!isleapyear(year) && (day < 1 || day > days[month])) {
printf("Illegal input.\n");
return -1;
}
int n = 0; // to store the result.
int i;
// add days of former months.
for (i = 1; i < month; i++) {
n += days[i];
}
// add days of this month.
n += day;
// check leap year
if (isleapyear(year) && month > 2)
n++;
printf("%d", n);
} |
11 | 5095 | main(){
int year,month,day;
scanf("%d %d %d",&year,&month,&day);
int i;
if(year%4==0||year%100==0){
if(month==1){
i=day;
}
else if(month==2){
i=(month-1)*31+day;
}
else{
i=(month-1)*31+day-month/2-1;
}
}
else{
if(month==1){
i=day;
}
else if(month==2){
i=(month-1)*31+day;
}
else{
i=(month-1)*31+day-month/2-1;
}
}
printf("%d",i);
return 0;
} |
11 | 5096 |
int main()
{
int rn[11] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30};
int pn[11] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30};
int y, m, d, dday;
int i, j;
int *x;
int n = 5;
x = malloc(15*sizeof(int));
for(i=0; i<n; i++)
{
scanf("%d %d %d", x+i*3, x+i*3+1, x+i*3+2);
}
for(i=0; i<n; i++)
{
dday = 0;
y = *(x+i*3);
m = *(x+i*3+1);
d = *(x+i*3+2);
if(y %4 ==0 && y % 100 !=0 || y % 400 ==0)
{
for(j = 0; j< m-1; j++)
dday = dday + rn[j];
}
else
{
for(j = 0; j< m-1; j++)
dday = dday + pn[j];
}
dday = dday + d;
printf("%d\n", dday);
}
return 0;
}
|
11 | 5097 | int leap(int);
int main()
{
int y,month,d,sum=0;
int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
cin>>y>>month>>d;
m[2]=m[2]+leap(y);
for(int i=0;i<month;i++)
{
sum=sum+m[i];
}
sum=sum+d;
cout<<sum<<endl;
return 0;
}
int leap(int n)
{
if((n%4==0&&n%100!=0)||(n%400==0))
return 1;
else
return 0;
} |
11 | 5098 | const int month[2][13]={{0,31,28,31,30,31,30,31,31,30,31,30,31},
{0,31,29,31,30,31,30,31,31,30,31,30,31}};
int main()
{
int i,leap=0,y,m,d,ans=0;
cin>>y>>m>>d;
if ((y%4==0)&&(y%100!=0)||(y%400==0)) leap=1;
for (i=1;i<m;i++) ans+=month[leap][i];
ans+=d;
cout<<ans<<endl;
return 0;
} |
11 | 5099 | void main()
{
int a[10], b[10], c[10],n[10],d,i;
for(i=0;i<5;i++)
{
scanf("%d%d%d",&a[i],&b[i],&c[i]);
}
for(i=0;i<5;i++)
{
if((a[i]%4==0&&a[i]%100!=0)||a[i]%400==0)
{
switch(b[i])
{
case 1: d=0;break;
case 2: d=31;break;
case 3: d=60;break;
case 4: d=91;break;
case 5: d=121;break;
case 6: d=152;break;
case 7: d=182;break;
case 8: d=213;break;
case 9: d=244;break;
case 10: d=274;break;
case 11: d=305;break;
case 12: d=335;break;
}
n[i]=d+c[i];
printf("%d\n",n[i]);
}
else
{
switch(b[i])
{
case 1: d=0;break;
case 2: d=31;break;
case 3: d=59;break;
case 4: d=90;break;
case 5: d=120;break;
case 6: d=151;break;
case 7: d=181;break;
case 8: d=212;break;
case 9: d=243;break;
case 10: d=273;break;
case 11: d=304;break;
case 12: d=334;break;
}
n[i]=d+c[i];
printf("%d\n",n[i]);
}
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.