id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
---|---|---|
24,600 | void main()
{
int w,i,day[13];
scanf("%d",&w);
day[1]=w+12;
for(i=1;i<12;i++)
{
if(i==1||i==3||i==5||i==7||i==8||i==10)day[i+1]=day[i]+31;
else if(i==2)day[i+1]=day[i]+28;
else if(i==4||i==6||i==9||i==11)day[i+1]=day[i]+30;
}
for(i=1;i<=12;i++)
{
if(day[i]%7==5)printf("%d\n",i);
}
} | 50 |
24,601 | int check(int a)
{
if(a>7)
return a-7;
else
return a;
}
int main()
{
int n;
scanf("%d",&n);
int m[12];
int i;
m[0]=12%7+n;
m[0]=check(m[0]);
//printf("%d",m[0]);
for(i=1;i<12;i++)
{
switch(i)
{
case 1:case 3:case 5:case 7:case 8:case 10:
m[i]=31%7+m[i-1];
break;
case 2:
m[i]=28%7+m[i-1];
break;
case 4:case 6:case 9:case 11:
m[i]=30%7+m[i-1];
}
m[i]=check(m[i]);
}
for(i=1;i<=12;i++)
if(m[i-1]==5)
printf("%d\n",i);
}
| 50 |
24,602 | int main ()
{
int w,i,a;
scanf("%d",&w);
if(w==7)
{
printf("1\n");
printf("10\n");
}
if(w==6)
{
printf("5\n");
}
if(w==2)
{
printf("9\n");
printf("12\n");
}
if(w==5)
{
printf("8\n");
}
if(w==4)
{
printf("2\n");
printf("3\n");
printf("11\n");
}
if(w==1)
{
printf("4\n");
printf("7\n");
}
if(w==3)
{
printf("6\n");
}
return 0;
}
| 50 |
24,603 |
int main(){
int w,m,d,y;
scanf("%d",&w);
for(m=1;m<2;m++){
d=13;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=2;m<3;m++){
d=44;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=3;m<4;m++){
d=72;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=4;m<5;m++){
d=103;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=5;m<6;m++){
d=133;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=6;m<7;m++){
d=164;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=7;m<8;m++){
d=194;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=8;m<9;m++){
d=225;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=9;m<10;m++){
d=256;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=10;m<11;m++){
d=286;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=11;m<12;m++){
d=317;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
for(m=12;m<13;m++){
d=347;
y=(d+w-1)%7;
if(y==5){
printf("%d\n",m);
}
}
return 0;
}
| 50 |
24,604 | int main()
{
int day[12];
day[1]=31;
day[2]=28;
day[3]=31;
day[4]=30;
day[5]=31;
day[6]=30;
day[7]=31;
day[8]=31;
day[9]=30;
day[10]=31;
day[11]=30;
day[12]=31;
int n,i,s=12,a=0;
scanf("%d",&n);
if(n+5>7&&n+5-7==5)
printf("1\n");
for(i=2;i<=12;i++)
{
s+=day[i-1];
a=n+s%7;
if(a>7&&a-7==5)
printf("%d\n",i);
if(a==5)
printf("%d\n",i);
}
return 0;
} | 50 |
24,605 | int main()
{
int w, k;
int l;
cin >> w;//???31???? w - 1?????
switch(w)
{
case 2:
case 3:
case 4:
case 5:
case 6:
case 7: k = w - 1;break;
case 1: k = 7;break;
default: break;
}
l = 13 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'1' <<endl;
l = 44 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'2' <<endl;
l = 72 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'3' <<endl;
l = 103 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'4' <<endl;
l = 133 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'5' <<endl;
l = 164 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'6' <<endl;
l = 194 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'7' <<endl;
l = 225 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'8' <<endl;
l = 256 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<'9' <<endl;
l = 286 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<"10" <<endl;
l = 317 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<"11" <<endl;
l = 347 % 7 + k;
if(l > 7)l = l - 7;
if(l == 5)cout <<"12"<<endl;
return 0;
} | 50 |
24,606 | int main()
{
int w,t=0,a;
int month_days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d",&w);
for (int i=1;i<=12;i++)
{
t+=month_days[i-1];
a=t+w+12;
if(a%7==5)
{
printf("%d\n",i);
}
}
return 0;
}
| 50 |
24,607 | void main()
{
int w,i,a[13]={0,13,44,72,103,133,164,194,225,256,286,317,347};
scanf("%d",&w);
for(i=1;i<13;i++)
{
a[i]=a[i]%7;
a[i]=a[i]+w-1;
if((a[i]%7)==5)
{
printf("%d\n",i);
}
}
} | 50 |
24,608 | void main()
{
int w,month[12],n,i=0;
scanf("%d",&w);
w=w+12;
if((w)%7==5)
{month[i]=1;
i++;}
w=w+3;
if(w%7==5)
{month[i]=2;
i++;
month[i]=3;
i++;}
w=w+3;
if(w%7==5)
{month[i]=4;
i++;}
w=w+2;
if(w%7==5)
{month[i]=5;
i++;}
w=w+3;
if(w%7==5)
{month[i]=6;
i++;}
w=w+2;
if(w%7==5)
{month[i]=7;
i++;}
w=w+3;
if(w%7==5)
{month[i]=8;
i++;}
w=w+3;
if(w%7==5)
{month[i]=9;
i++;}
w=w+2;
if(w%7==5)
{month[i]=10;
i++;}
w=w+3;
if(w%7==5)
{month[i]=11;
i++;}
w=w+2;
if(w%7==5)
{month[i]=12;
i++;}
n=i;
for(i=0;i<n;i++)
printf("%d\n",month[i]);
}
| 50 |
24,609 | int main()
{
int w;
int i,j;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d",&w);
w--;
for (i=0;i<12;i++)
for (j=1;j<=day[i];j++)
{
w++;
if (w>7) w=w-7;
if ((j==13)&&(w==5))
printf("%d\n",i+1);
}
}
| 50 |
24,610 | int main()
{
int n,i;
int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d",&n);
for(i=0;i<7;i++)
{
if((n+i)%7==5)
{
n=(1+i)%7;//??????
break;
}
}
//printf("first Friday=%d\n",n);
int e=13;
for(i=0;i<12;i++)
{
e=e+m[i];
//printf("%d\n",e);
if(e%7==n)
{
printf("%d\n",i+1);
}
}
return 0;
} | 50 |
24,611 |
int main ()
{
int d[]={0,31,59,90,120,151,181,212,243,273,304,334,365};
int mon=0,w=12,n,i;
scanf("%d",&n);
w=w+n;
if(w%7==5)
{printf("%d\n",mon+1);}
if((w+d[1])%7==5)
{printf("%d\n",mon+2);}
if((w+d[2])%7==5)
{printf("%d\n",mon+3);}
if((w+d[3])%7==5)
{printf("%d\n",mon+4);}
if((w+d[4])%7==5)
{printf("%d\n",mon+5);}
if((w+d[5])%7==5)
{printf("%d\n",mon+6);}
if((w+d[6])%7==5)
{printf("%d\n",mon+7);}
if((w+d[7])%7==5)
{printf("%d\n",mon+8);}
if((w+d[8])%7==5)
{printf("%d\n",mon+9);}
if((w+d[9])%7==5)
{printf("%d\n",mon+10);}
if((w+d[10])%7==5)
{printf("%d\n",mon+11);}
if((w+d[11])%7==5)
{printf("%d\n",mon+12);}
} | 50 |
24,612 |
int main(int argc, char* argv[])
{
int w,month,day;
scanf("%d",&w);
for (month=1;month<=12;month++)
{
switch (month){
case 1:
day = ((13-1)%7+w)%7;
break;
case 2:
day = ((13+31-1)%7+w)%7;
break;
case 3:
case 5:
case 7:
case 8:
case 10:
case 12:
day = ((13+28+31*(month/2)+30*((month-1)/2-1)-1)%7+w)%7;
break;
case 4:
case 6:
case 9:
case 11:
day = ((13+28+31*((month+1)/2)+30*((month+1)/3-1)-1)%7+w)%7;
break;
}
if (day==5)
{
printf("%d\n",month);
}
}
return 0;
}
| 50 |
24,613 |
void main()
{ int i,n,a[12],s=0;
scanf("%d",&n);
if((12+n)%7==5)
{a[s]=1;
s=s+1;
}
if((3+12+n)%7==5)
{a[s]=2;
s=s+1;
}
if((3+12+n)%7==5)
{a[s]=3;
s=s+1;
}
if((6+12+n)%7==5)
{a[s]=4;
s=s+1;
}
if((1+12+n)%7==5)
{a[s]=5;
s=s+1;
}
if((4+12+n)%7==5)
{a[s]=6;
s=s+1;
}
if((6+12+n)%7==5)
{a[s]=7;
s=s+1;
}
if((2+12+n)%7==5)
{a[s]=8;
s=s+1;
}
if((5+12+n)%7==5)
{a[s]=9;
s=s+1;
}
if((0+12+n)%7==5)
{a[s]=10;
s=s+1;
}
if((3+12+n)%7==5)
{a[s]=11;
s=s+1;
}if((5+12+n)%7==5)
{a[s]=12;
s=s+1;
}
for(i=0;i<s;i++)
{printf("%d\n",a[i]);}
}
| 50 |
24,614 | int main(){
int w,d,i;
d=0;
scanf("%d",&w);
if(w==1){
for(i=0;i<12;i++){
if(i==0){
if(13%7==5){
printf("%d\n",i+1);
}
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
d+=31;
if((d+13)%7==5){
printf("%d\n",i+1);
}
}
else if(i==2){
d+=28;
if((d+13)%7==5){
printf("%d\n",i+1);
}
}
else if(i==4||i==6||i==9||i==11){
d+=30;
if((d+13)%7==5){
printf("%d\n",i+1);
}
}
}
}
else if(w==2){
for(i=0;i<12;i++){
if(i==0){
if(13%7==4){
printf("%d\n",i+1);
}
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
d+=31;
if((d+13)%7==4){
printf("%d\n",i+1);
}
}
else if(i==2){
d+=28;
if((d+13)%7==4){
printf("%d\n",i+1);
}
}
else if(i==4||i==6||i==9||i==11){
d+=30;
if((d+13)%7==4){
printf("%d\n",i+1);
}
}
}
}
else if(w==3){
for(i=0;i<12;i++){
if(i==0){
if(13%7==3){
printf("%d\n",i+1);
}
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
d+=31;
if((d+13)%7==3){
printf("%d\n",i+1);
}
}
else if(i==2){
d+=28;
if((d+13)%7==3){
printf("%d\n",i+1);
}
}
else if(i==4||i==6||i==9||i==11){
d+=30;
if((d+13)%7==3){
printf("%d\n",i+1);
}
}
}
}
else if(w==4){
for(i=0;i<12;i++){
if(i==0){
if(13%7==2){
printf("%d\n",i+1);
}
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
d+=31;
if((d+13)%7==2){
printf("%d\n",i+1);
}
}
else if(i==2){
d+=28;
if((d+13)%7==2){
printf("%d\n",i+1);
}
}
else if(i==4||i==6||i==9||i==11){
d+=30;
if((d+13)%7==2){
printf("%d\n",i+1);
}
}
}
}
else if(w==5){
for(i=0;i<12;i++){
if(i==0){
if(13%7==1){
printf("%d\n",i+1);
}
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
d+=31;
if((d+13)%7==1){
printf("%d\n",i+1);
}
}
else if(i==2){
d+=28;
if((d+13)%7==1){
printf("%d\n",i+1);
}
}
else if(i==4||i==6||i==9||i==11){
d+=30;
if((d+13)%7==1){
printf("%d\n",i+1);
}
}
}
}
else if(w==6){
for(i=0;i<12;i++){
if(i==0){
if(13%7==0){
printf("%d\n",i+1);
}
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
d+=31;
if((d+13)%7==0){
printf("%d\n",i+1);
}
}
else if(i==2){
d+=28;
if((d+13)%7==0){
printf("%d\n",i+1);
}
}
else if(i==4||i==6||i==9||i==11){
d+=30;
if((d+13)%7==0){
printf("%d\n",i+1);
}
}
}
}
else if(w==7){
for(i=0;i<12;i++){
if(i==0){
if(13%7==6){
printf("%d\n",i+1);
}
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
d+=31;
if((d+13)%7==6){
printf("%d\n",i+1);
}
}
else if(i==2){
d+=28;
if((d+13)%7==6){
printf("%d\n",i+1);
}
}
else if(i==4||i==6||i==9||i==11){
d+=30;
if((d+13)%7==6){
printf("%d\n",i+1);
}
}
}
}
return 0;
} | 50 |
24,615 | void main()
{
int w;
scanf("%d\n",&w);
int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int b[12],i,j; // ???13??1.1??????????
b[0]=12;
for(i=1;i<12;i++)
{ b[i]=0;
for(j=0;j<i;j++)
b[i]=b[i]+a[j];
b[i]=b[i]+12;
}
for(i=0;i<12;i++)
{
int y;
y=b[i]%7;
if((y+w)%7==5)
printf("%d\n",i+1);
}
}
| 50 |
24,616 | int main()
{
int w, i, s, t, n;
scanf("%d", &w);
for(i=0;i<12;i++){
if(i==0){
s=13;
}
else if(i==1||i==3||i==5||i==7||i==8||i==10){
s+=31;
}
else if(i==2){
s+=28;
}
else if(i==4||i==6||i==9||i==11){
s+=30;
}
t=s-6+w;
if(t%7==0){
n=i+1;
printf("%d\n", n);
}
}
return 0;
}
| 50 |
24,617 | int main()
{
int w,i,a[12];
scanf("%d",&w);
if(w<3)
a[1]=w+5;
else
a[1]=w-2;
a[2]=a[1]+31%7;
if(a[2]>7)
a[2]-=7;
a[3]=a[2];
a[4]=a[3]+31%7;
if(a[4]>7)
a[4]-=7;
a[5]=a[4]+30%7;
if(a[5]>7)
a[5]-=7;
a[6]=a[5]+31%7;
if(a[6]>7)
a[6]-=7;
a[7]=a[6]+30%7;
if(a[7]>7)
a[7]-=7;
a[8]=a[7]+31%7;
if(a[8]>7)
a[8]-=7;
a[9]=a[8]+31%7;
if(a[9]>7)
a[9]-=7;
a[10]=a[9]+30%7;
if(a[10]>7)
a[10]-=7;
a[11]=a[10]+31%7;
if(a[11]>7)
a[11]-=7;
a[12]=a[11]+30%7;
if(a[12]>7)
a[12]-=7;
for(i=1;i<=12;i++)
if(a[i]==5)
printf("%d\n",i);
return 0;
} | 50 |
24,618 | int main()
{
int xingqi,yue,zong=0,panduan;
scanf("%d",&xingqi);
for(yue=1;yue<13;yue++){
panduan=(zong+12)%7+xingqi;
if(panduan>7)
panduan=panduan-7;
if(panduan==5)
printf("%d\n",yue);
if(yue==1||yue==3||yue==5||yue==7||yue==8||yue==10||yue==12)
zong=zong+31;
else if(yue==4||yue==6||yue==9||yue==11)
zong=zong+30;
else if(yue==2)
zong=zong+28;
}
return 0;
} | 50 |
24,619 | //***************************************************************************************
//??:???????????????? *
//?????10.20 *
//????wayne *
//***************************************************************************************
int main()
{
int n,i,a[13];
cin>>n;
a[1]=12+n,a[2]=a[1]+31,a[3]=a[2]+28;
a[4]=a[3]+31,a[5]=a[4]+30,a[6]=a[5]+31;
a[7]=a[6]+30,a[8]=a[7]+31,a[9]=a[8]+31;
a[10]=a[9]+30,a[11]=a[10]+31,a[12]=a[11]+30; //????????13??1.1???
for (i=1;i<=12;i++) //????????????
if (a[i]%7==5) cout<<i<<endl; //???????
return 0;
} | 50 |
24,620 | int main(){
int n,i,k,w;
scanf("%d",&w);
if((w+5)%7==5){
printf("%d\n",1);
}
if((w+36)%7==5){
printf("%d\n",2);
}
if((w+36+28)%7==5){
printf("%d\n",3);
}
if((w+36+28+31)%7==5){
printf("%d\n",4);
}
if((w+36+28+61)%7==5){
printf("%d\n",5);
}
if((w+36+28+92)%7==5){
printf("%d\n",6);
}
if((w+36+28+122)%7==5){
printf("%d\n",7);
}
if((w+36+28+153)%7==5){
printf("%d\n",8);
}
if((w+36+28+184)%7==5){
printf("%d\n",9);
}
if((w+36+28+214)%7==5){
printf("%d\n",10);
}
if((w+36+28+245)%7==5){
printf("%d\n",11);
}
if((w+36+28+275)%7==5){
printf("%d\n",12);
}
return 0;
} | 50 |
24,621 | int main()
{
int w,i,b,c;
int a[13];
scanf("%d",&w);
a[1]=0;
a[2]=31;
a[3]=28;
a[4]=31;
a[5]=30;
a[6]=31;
a[7]=30;
a[8]=31;
a[9]=31;
a[10]=30;
a[11]=31;
a[12]=30;
for(i=1;i<=12;i++)
{w=w+a[i];
c=w%7;
if(c==0)
{printf("%d\n",i);}
}
return 0;
} | 50 |
24,622 |
int day(int month){
int t=0,i;
for(i=1;i<month;i++){
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12){
t+=31;
}else if(i==4||i==6||i==9||i==11){
t+=30;
}else if(i==2){
t+=28;
}
}
return t;
}
int main()
{
int w,i,t,a;
scanf("%d",&w);
for(i=1;i<=12;i++){
t=0;
t=13+day(i);
a=t%7+w-1;
if(a>7){
a=a-7;
}
if(a==5){
printf("%d\n",i);
}
}
return 0;
} | 50 |
24,623 | main()
{
int w,i,e;
scanf("%d",&w);
w+=12;
for (i=1;;i++)
{
e=w%7;
if (e==5)
printf ("%d\n",i);
if (i==1||i==3||i==5||i==7||i==8||i==10)
w+=31;
else if (i==4||i==6||i==9||i==11)
w+=30;
else if (i==2)
w+=28;
else
break;
}
} | 50 |
24,624 | int main()
{
int w,w1;
scanf("%d", &w);
if(w>=1 && w<=5)
w1 = 6 - w;
else
w1 = 13- w;
if(w==7)
printf("1\n");
if((13+31-w1)%7 == 0)
printf("2\n");
if((13+28+31-w1)%7 == 0)
printf("3\n");
if((13+31+28+31-w1)%7 == 0)
printf("4\n");
if((13+30+31+28+31-w1)%7 == 0)
printf("5\n");
if((13+31+30+31+28+31-w1)%7 == 0)
printf("6\n");
if((13+30+31+30+31+28+31-w1)%7 == 0)
printf("7\n");
if((13+31+30+31+30+31+28+31-w1)%7 == 0)
printf("8\n");
if((13+31+31+30+31+30+31+28+31-w1)%7 == 0)
printf("9\n");
if((13+30+31+31+30+31+30+31+28+31-w1)%7 == 0)
printf("10\n");
if((13+31+30+31+31+30+31+30+31+28+31-w1)%7 == 0)
printf("11\n");
if((13+30+31+30+31+31+30+31+30+31+28+31-w1)%7 == 0)
printf("12\n");
return 0;
}
| 50 |
24,625 | int main()
{
int w,b[20],i,sum[20];
scanf("%d",&w);
int a[12]={0,31,28,31,30,31,30,31,31,30,31,30};
for(i=0;i<12;i++)
{
if(i==0)
{sum[i]=0;
b[i]=(sum[i]+w-1+13)%7;
}
else
{
sum[i]=a[i]+sum[i-1];
b[i]=(sum[i]+w-1+13)%7;
}
if (b[i]==5)
{printf("%d\n",i+1);
}
}
return 0;
}
| 50 |
24,626 | int main(){
int n;
int b;
scanf("%d",&b);
n=8-b;
if(n==1)
printf("1\n");
if(n==((13+31-5)%7)||((13+31-5)%7)==(n-7))
printf("2\n");
if(n==((13+31+28-5)%7)||((13+31+28-5)%7)==(n-7))
printf("3\n");
if(n==((13+31+28+31-5)%7)||((13+31+28+31-5)%7)==(n-7))
printf("4\n");
if(n==((13+31+28+31+30-5)%7)||((13+31+28+31+30-5)%7)==(n-7))
printf("5\n");
if(n==((13+31+28+31+30+31-5)%7)||((13+31+28+31+30+31-5)%7)==(n-7))
printf("6\n");
if(n==((13+31+28+31+30+31+30-5)%7)||((13+31+28+31+30+31+30-5)%7)==(n-7))
printf("7\n");
if(n==((13+31+28+31+30+31+30+31-5)%7)||((13+31+28+31+30+31+30+31-5)%7)==(n-7))
printf("8\n");
if(n==((13+31+28+31+30+31+30+31+31-5)%7)||((13+31+28+31+30+31+30+31+31-5)%7)==(n-7))
printf("9\n");
if(n==((13+31+28+31+30+31+30+31+31+30-5)%7)||((13+31+28+31+30+31+30+31+31+30-5)%7)==(n-7))
printf("10\n");
if(n==((13+31+28+31+30+31+30+31+31+30+31-5)%7)||((13+31+28+31+30+31+30+31+31+30+31-5)%7)==(n-7))
printf("11\n");
if(n==((13+31+28+31+30+31+30+31+31+30+31+30-5)%7)||((13+31+28+31+30+31+30+31+31+30+31+30-5)%7)==(n-7))
printf("12\n");
return 0;
}
| 50 |
24,627 |
main(){
int n, i, mon[11]={31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30}, day[12];
scanf("%d", &n);
day[0]=0;
for(i=1; i<12; i++) day[i]=mon[i-1]+day[i-1];
for(i=0; i<12; i++) day[i]=day[i]+13+(n-1);
for(i=0; i<12; i++){
if(day[i]%7==5) printf("%d\n", i+1);
else continue;
}
} | 50 |
24,628 |
int main()
{
int m[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int w;
cin >> w;
int days = 13;
for (int i = 1; i <= 12; i++)
{
days += m[i - 1];
if ((days - 1 + w) % 7 == 5)
cout << i << endl;
}
return 0;
} | 50 |
24,629 | int main(int argc, char* argv[])
{
int a[12]={13,44,72,103,133,164,194,225,256,286,317,347};
int n;
scanf("%d",&n);
int i;
for(i=0;i<12;i++){
if((a[i]-1+n)%7==5)
printf("%d\n",i+1);
}
return 0;
}
| 50 |
24,630 | int date(int);
int main()
{
int w, W;
cin >> w;
if(w <= 5)
W = 5 - w;
else
W = 12 - w;
for(int j = 1; j <= 12; j++)
{
if(date(j) % 7 == W)
cout << j << endl;
}
return 0;
}
int date(int cf)
{
int sum, month[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
if(cf == 1)
sum = 12;
else
{
sum = 43;
for(int i = 2; i < cf; i++)
sum = sum + month[i];
}
return sum;
} | 50 |
24,631 | int Dijitian(int month,int day)
{
int days=0,i;
for(i=1;i<month;i++)
{
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12)
{
days+=31;
}
else
{
if(i==2)
{
days+=28;
}
else
{
days+=30;
}
}
}
days+=day;
return days;
}
int main()
{
int w,i;
scanf("%d",&w);
for(i=1;i<13;i++)
{
if((Dijitian(i,13)-1)%7+w==5||(Dijitian(i,13)-1)%7+w==12)
{
printf("%d\n",i);
}
}
return 0;
} | 50 |
24,632 | int main()
{
int n,i,sum=12,a,b;
scanf("%d",&n);
for(i=1;i<=12;i++){
if(i==1)
sum+=0;
if(i==2||i==4||i==6||i==8||i==9||i==11)
sum+=31;
else if(i==5||i==7||i==10||i==12)
sum+=30;
else sum+=28;
a=sum%7;
b=a+n;
if(b>7)
b=b-7;
if(b==5)
printf("%d\n",i);
}
return 0;
}
| 50 |
24,633 | int main ()
{
int w, a[13] = {0}, sum;
int b[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
cin >> w;
for (int i = 1; i <= 12; i++)
{
for (int j = 1; j < i; j++)
a[i] += b[j];
a[i] = a[i] + 13;
if ((a[i] % 7 - 1 + w) % 7 == 5)
cout << i << endl;
}
return 0;
}
| 50 |
24,634 |
int main()
{
int w,a,b;
scanf("%d",&w);
a=w+12;
b=a%7;
if(b==5)
printf("1\n");
a=b+31;
b=a%7;
if(b==5)
printf("2\n");
a=b+28;
b=a%7;
if(b==5)
printf("3\n");
a=b+31;
b=a%7;
if(b==5)
printf("4\n");
a=b+30;
b=a%7;
if(b==5)
printf("5\n");
a=b+31;
b=a%7;
if(b==5)
printf("6\n");
a=b+30;
b=a%7;
if(b==5)
printf("7\n");
a=b+31;
b=a%7;
if(b==5)
printf("8\n");
a=b+31;
b=a%7;
if(b==5)
printf("9\n");
a=b+30;
b=a%7;
if(b==5)
printf("10\n");
a=b+31;
b=a%7;
if(b==5)
printf("11\n");
a=b+30;
b=a%7;
if(b==5)
printf("12\n");
} | 50 |
24,635 | int main()
{
int w;
scanf("%d",&w);
if((((13%7)-1+w)==5)||(((13%7)-1+w)==12))
printf("1\n");
if((((44%7)-1+w)==5)||(((44%7)-1+w)==12))
printf("2\n");
if((((72%7)-1+w)==5)||(((72%7)-1+w)==12))
printf("3\n");
if((((103%7)-1+w)==5)||(((103%7)-1+w)==12))
printf("4\n");
if((((133%7)-1+w)==5)||(((133%7)-1+w)==12))
printf("5\n");
if((((164%7)-1+w)==5)||(((164%7)-1+w)==12))
printf("6\n");
if((((194%7)-1+w)==5)||(((194%7)-1+w)==12))
printf("7\n");
if((((225%7)-1+w)==5)||(((225%7)-1+w)==12))
printf("8\n");
if((((256%7)-1+w)==5)||(((1256%7)-1+w)==12))
printf("9\n");
if((((286%7)-1+w)==5)||(((286%7)-1+w)==12))
printf("10\n");
if((((317%7)-1+w)==5)||(((317%7)-1+w)==12))
printf("11\n");
if((((347%7)-1+w)==5)||(((347%7)-1+w)==12))
printf("12\n");
return 0;
}
// 13 44 74 103 133 164 194 225 256 286 317 347 | 50 |
24,636 | int main()
{
int w,weekday[12],day[12]={12,43,71,102,132,163,193,224,255,285,316,346};
int m,i;
scanf("%d",&w);
for(i=0;i<12;i++)
{
weekday[i]=day[i]%7;
}
for(i=0;i<12;i++)
{
if(w+weekday[i]>7)
weekday[i]=w+weekday[i]-7;
else
weekday[i]=w+weekday[i];
}
for(i=0;i<12;i++)
{
if(weekday[i]==5)
{m=i+1;
printf("%d\n",m);}
}
return 0;
}
| 50 |
24,637 | int main(){
int m,i,t,w;
int sz[20];
t=0;
scanf("%d",&m);
w=(m+12)%7;
sz[1]=w;
sz[2]=(w+31)%7;
sz[3]=(sz[2]+28)%7;
sz[4]=(sz[3]+31)%7;
sz[5]=(sz[4]+30)%7;
sz[6]=(sz[5]+31)%7;
sz[7]=(sz[6]+30)%7;
sz[8]=(sz[7]+31)%7;
sz[9]=(sz[8]+31)%7;
sz[10]=(sz[9]+30)%7;
sz[11]=(sz[10]+31)%7;
sz[12]=(sz[11]+30)%7;
for(i=1;i<=12;i++){
if(sz[i]==5){printf("%d\n",i);t=1;}
}
return 0;
} | 50 |
24,638 |
int main()
{
int w,i;
int m[12]={13,44,72,103,133,164,194,225,256,286,317,347};
scanf("%d",&w);
for (i=0; i<12; i++) {
if (w==1) {
if ((m[i]-5)%7==0) {
printf("%d\n",i+1);
}
}
else
if ((m[i]-5)%7==(8-w)) {
printf("%d\n",i+1);
}
}
}
| 50 |
24,639 | int main(){
int w;
cin>>w;
for(int i=1;i<=12;i++){
if((w+12)%7==5) cout<<i<<endl;
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12) w+=31;
if(i==2) w+=28;
if(i==4||i==6||i==9||i==11) w+=30;
}
return 0;
}
| 50 |
24,640 | int main()
{ int r[12]={0,31,28,31,30,31,30,31,31,30,31,30};
int i,j=0,k,l,m,n,s,t,a[12][2],b[12],w;
for(i=0;i<12;i++)
{b[i]=0;}
cin>>w;
for(i=0;i<12;i++)
{a[i][0]=0;
a[i][1]=i+1;}
for(i=1;i<12;i++)
{a[i][0]=a[i-1][0]+r[i];
}
for(i=0;i<12;i++)
{
if(a[i][0]%7==7-w)
b[j]=a[i][1],j++;
}
if(b[0]!=0)
cout<<b[0];
for(i=1;b[i]!=0;i++)
cout<<endl<<b[i];
}
| 50 |
24,641 | int main()
{
int w,i;
int a[12],k[12];
a[0]=k[0]=0;
a[1]=a[3]=a[5]=a[7]=a[8]=a[10]=a[12]=31,a[4]=a[6]=a[9]=a[11]=30,a[2]=28;
scanf("%d",&w);
for(i=1;i<=12;i++){
k[i]=k[i-1]+a[i-1];
if((k[i]+w)%7==0)
printf("%d\n",i);
}
return 0;
} | 50 |
24,642 | int main()
{
int w, a[13], b[13], c[13], i;//a[i]??i?1??????b[i]??i?13?????
c[1] = c[3] = c[5] = c[7] = c[8] = c[10] = c[12] = 31 % 7;
c[2] = 28 % 7;
c[4] = c[6] = c[9] = c[11] = 30 % 7;
cin >> w;
a[1] = w;
b[1] = (a[1] + 12) % 7;
for(i = 2;i <= 12;i++)
{
a[i] = (a[i - 1] + c[i - 1]) % 7;
b[i] = (a[i] + 12) % 7;
}
for(i = 1;i <= 12;i++)
{
if(b[i] == 5)
{cout << i << endl;}
}
} | 50 |
24,643 | int main()
{
int a[13], i, w, n = 12;
cin >> w;
n = n + w;
a[1] = 31;
a[2] = 28;
a[3] = 31;
a[4] = 30;
a[5] = 31;
a[6] = 30;
a[7] = 31;
a[8] = 31;
a[9] = 30;
a[10] = 31;
a[11] = 30;
a[12] = 31;
for (i = 1; i <= 12; i++)
{
if ((n % 7) == 5)
cout << i << endl;
n = n + a[i];
}
return 0;
}
| 50 |
24,644 |
int date(int month);
int daycount(int month);
int main()
{
int day=0;
scanf("%d",&day);
int remainder=0;
if(day>5)
remainder=12-day;
if(day<5)
remainder=5-day;
int month=1;
for(;month<=12;month++)
{
if(daycount(month)%7==remainder)
printf("%d\n",month);
}
return 0;
}
int date(int month)
{
switch(month)
{
case 1: case 3: case 5: case 7: case 8: case 10: case 12:
return 31;
break;
case 2:
return 28;
break;
case 4: case 6: case 9: case 11:
return 30;
break;
}
}
int daycount(int month)
{
if(month==1)
return 12;
int sum=12;
int mon=1;
for(;mon<month;mon++)
sum+=date(mon);
return sum;
}
| 50 |
24,645 | int main(){
int w,d=1;
scanf("%d",&w);
if (w==1)
d=5;
if (w==2)
d=4;
if (w==3)
d=3;
if (w==4)
d=2;
if (w==6)
d=7;
if (w==7)
d=6;
if ((13-d)%7==0)
printf("1\n");
if ((44-d)%7==0)
printf("2\n");
if ((72-d)%7==0)
printf("3\n");
if ((103-d)%7==0)
printf("4\n");
if ((133-d)%7==0)
printf("5\n");
if ((164-d)%7==0)
printf("6\n");
if ((194-d)%7==0)
printf("7\n");
if ((225-d)%7==0)
printf("8\n");
if ((256-d)%7==0)
printf("9\n");
if ((286-d)%7==0)
printf("10\n");
if ((317-d)%7==0)
printf("11\n");
if ((347-d)%7==0)
printf("12\n");
return 0;
}
| 50 |
24,646 | int main ()
{
int w,t;
scanf ("%d",&w);
int month[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int m;
m = 13%7+w-1;
if (m>7) m = m-7;
if (m==5) printf ("1\n");
int i,j,day[12]={0};
for (i=1;i<12;i++)
{
for (j=0;j<i;j++)
day[i] += month[j];
day[i] += 13;
t = day[i]%7+w-1;
if (t>7) t = t-7;
if (t==5) printf ("%d\n",i+1);
}
return 0;
} | 50 |
24,647 | int main()
{
int w,m,d=12;
scanf("%d",&w);
for(m=1;m<=12;m++)
{
if(m-1==1||m-1==3||m-1==5||m-1==7||m-1==8||m-1==10)
d=d+31;
else if(m-1==0)
d=d+0;
else if(m-1==2)
d=d+28;
else d=d+30;
if((d+w)%7==5)
printf("%d\n",m);
}
}
| 50 |
24,648 | int main()
{
int w,m,x,sd=13,p,d,i;
scanf("%d",&w);
for(m=1;m<=12;m++)
{
for(i=1;i<=m;i++)
{
switch(i)
{
case 1:
p=0;
break; case 2:
p=31;
break; case 3:
p=28;
break; case 4:
p=31;
break; case 5:
p=30;
break; case 6:
p=31;
break; case 7:
p=30;
break; case 8:
p=31;
break; case 9:
p=31;
break; case 10:
p=30;
break; case 11:
p=31;
break; case 12:
p=30;
}
}sd=sd+p;
d=sd%7;
x=(d+w-1)%7;
if(x==5)
printf("%d\n",m);
}
return 0;
} | 50 |
24,649 | int main()
{
int w,i,W,day=13;
cin>>w;
for(i=0;i<=11;i++) //??i+1????????
{
if(i==1||i==3||i==5||i==7||i==8||i==10)
day=day+31;
else if(i==2)
day=day+28;
else if(i==0)
day=day+0;
else
day=day+30; //?????i+1?????
W=(w+((day-1)%7))%7; //??i+1??13?????
if(W==5)
cout<<i+1<<'\n'; //???????????
}
return 0;
} | 50 |
24,650 | int main( )
{
int day,mon,i,sum,xingqiji;
cin >> day;
sum = day + 12;
for ( mon = 1; mon <= 12; mon++)
{
switch(mon)
{
case 1 : i = 0; break;
case 2 :
case 4 :
case 6 :
case 8 :
case 9 :
case 11 : i = 31; break;
case 3 : i = 28; break;
case 5 :
case 7 :
case 10 :
case 12 : i = 30; break;
}
sum = sum + i;
xingqiji = sum % 7;
if ( xingqiji == 5 ) cout << mon << endl;
}
return 0;
} | 50 |
24,651 | int main()
{
int days_within_a_year(int a,int b);
int week11,week,i;
scanf("%d",&week11);
for(i=0;i<12;i++)
{
week=(days_within_a_year(i+1,13)+week11)%7;
if(week==5)
printf("%d\n",i+1);
}
return 0;
}
int days_within_a_year(int a,int b)
{
int n,d;
switch(a)
{
case 1:n=0;break;
case 2:n=31;break;
case 3:n=31+28;break;
case 4:n=31+28+31;break;
case 5:n=31+28+31+30;break;
case 6:n=31+28+31+30+31;break;
case 7:n=31+28+31+30+31+30;break;
case 8:n=31+28+31+30+31+30+31;break;
case 9:n=31+28+31+30+31+30+31+31;break;
case 10:n=31+28+31+30+31+30+31+31+30;break;
case 11:n=31+28+31+30+31+30+31+31+30+31;break;
case 12:n=31+28+31+30+31+30+31+31+30+31+30;break;
}
d=n+b-1;
return(d);
} | 50 |
24,652 | int main()
{
int i,d[100],y,a,w;
int m[100]={31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d",&w);
for(i=1;i<=12;i++){
if (i==1)
d[1]=12;
if (i>=2){
d[i]=d[i-1]+m[i-2];}
}
for(i=1;i<=12;i++){
y=w-5;
a=(d[i]+y)%7;
if(a==0)
printf("%d\n",i);
}
return 0;
} | 50 |
24,653 | //********************
//*****?????*****
//**?? 1100012915***
//*******11.7*********
//********************
int main()
{
int i,first;//first???????
int mon[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};//?????
int every13[13];//??????13?????
cin >> first;
every13[1] = first + 12 % 7 ;//??????
if ( every13[1] > 7 )
every13[1] = every13[1] - 7 ;//??7????7
for ( i = 2 ; i <= 12 ; i ++ )//??2~12?13?????
{
every13[i] = every13[i - 1] + mon[i - 1] % 7 ;
if ( every13[i] > 7)
every13[i] = every13[i] - 7;
}
for ( i = 1 ; i <= 12 ; i ++ )
if ( every13[i] == 5 )//????????????????
cout << i <<endl;
return 0;
} | 50 |
24,654 |
int main(){
int w,m,e=0,k;
scanf("%d",&w);
for(m=1;m<=12;m++){
k=(e+13)%7;
if((k+w-1==5)||(k+w-8==5)){
printf("%d\n",m);
}
if(m==1||m==3||m==5||m==7||m==8||m==10||m==12){
e=e+31;
}else if(m==2){
e=e+28;
}else{
e=e+30;
}
}
return 0;
} | 50 |
24,655 | int main()
{
int a[12]={0,31,28,31,30,31,30,31,31,30,31,30},b[13]={0},i,j,k,w;
scanf("%d",&w);
k=(w+5)%7;
b[1]=k;
for(i=2;i<=12;i++)
{
b[i]=(b[i-1]+a[i-1])%7;
}
for(i=1;i<=12;i++)
{
if(b[i]==5)
printf("%d\n",i);
}
return 0;
} | 50 |
24,656 |
int main()
{
int w,i,j,day,x,y;
int a[12];
scanf("%d",&w);
a[0]=31;
a[2]=31;
a[4]=31;
a[6]=31;
a[7]=31;
a[9]=31;
a[11]=31;
a[1]=28;
a[3]=30;
a[5]=30;
a[8]=30;
a[10]=30;
for(i=0;i<12;i++)
{
day=0;
for(j=0;j<i;j++)
day+=a[j];
day+=12;
x=day%7;
y=x+w;
if(y%7==5)
printf("%d\n",i+1);
}
return 0;
} | 50 |
24,657 | void main()
{
int w,a[12]={12,31,28,31,30,31,30,31,31,30,31,30},b,c,i=0;
scanf("%d",&w);
while(i<=11)
{
b=a[i]%7+w;
c=b%7;
if (c==5)
{printf("%d\n",i+1);i=i+1;a[i]=a[i]+a[i-1];}
else {i=i+1;a[i]=a[i]+a[i-1];}
}
} | 50 |
24,658 |
int main(int argc, char* argv[])
{
int n,day,yu,i,k;
int sum=0;
int monthday[12]={31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d",&n);
for(i=0;i<12;i++){
sum=0;
for(k=0;k<i;k++){
sum=sum+monthday[k];
}
sum=sum+12;
yu=sum%7;
if(yu+n<=7){
day=yu+n;
}
else if(yu+n>7){
day=n-(7-yu);
}
else;
if(day==5){
printf("%d\n",i+1);
}
}
return 0;
}
| 50 |
24,659 | int main()
{
int a[13]={0,13,44,72,103,133,164,194,225,256,286,317,347};
int b[13], w,i ;
scanf("%d", &w);
for (i=1; i<=12; i++)
{
b[i]=a[i]%7;
}
if( w!=7 )
{
for(i = 1;i <=12; i++)
{
if( b[i] == 6 - w)
printf("%d\n",i);
}
}
if( w==7 )
{
for(i=1; i<=12; i++)
{
if(b[i] == 6)
printf("%d\n",i);
}
}
return 0;
} | 50 |
24,660 | int w;
void judge(int month,int w);
void main()
{
int month,cha;
scanf("%d",&w);
month=1;
cha=13;
judge(month,cha);
month=2;
cha=13+31;
judge(month,cha);
month=3;
cha=13+31+28;
judge(month,cha);
month=4;
cha=13+31+28+31;
judge(month,cha);
month=5;
cha=13+31+28+31+30;
judge(month,cha);
month=6;
cha=13+31+28+31+30+31;
judge(month,cha);
month=7;
cha=13+31+28+31+30+31+30;
judge(month,cha);
month=8;
cha=13+31+28+31+30+31+30+31;
judge(month,cha);
month=9;
cha=13+31+28+31+30+31+30+31+31;
judge(month,cha);
month=10;
cha=13+31+28+31+30+31+30+31+31+30;
judge(month,cha);
month=11;
cha=13+31+28+31+30+31+30+31+31+30+31;
judge(month,cha);
month=12;
cha=13+31+28+31+30+31+30+31+31+30+31+30;
judge(month,cha);
}
void judge(int month,int cha)
{
int x;
x=(w+cha-1)%7;
if(x==5) printf("%d\n",month);
}
| 50 |
24,661 | int main()
{
int n;
scanf("%d",&n);
if(13%7==6-n||13%7==13-n){printf("1\n");}if(44%7==6-n||44%7==13-n){printf("2\n");}if(72%7==6-n||72%7==13-n){printf("3\n");}
if(103%7==6-n||103%7==13-n){printf("4\n");}if(133%7==6-n||133%7==13-n){printf("5\n");}if(164%7==6-n||164%7==13-n){printf("6\n");}
if(194%7==6-n||194%7==13-n){printf("7\n");}if(225%7==6-n||225%7==13-n){printf("8\n");}if(256%7==6-n||256%7==13-n){printf("9\n");}
if(286%7==6-n||286%7==13-n){printf("10\n");}if(317%7==6-n||317%7==13-n){printf("11\n");}if(347%7==6-n||347%7==13-n){printf("12\n");}
return 0;
} | 50 |
24,662 |
main()
{
int w,t,i, s;
scanf("%d", &w);
int month[12]={12, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30};
s=0;
for (i=1; i<=12; i++)
{
s=s+month[i-1];
t=w+s;
if (t%7==5)
{
printf("%d\n", i);
}
}
}
| 50 |
24,663 | //*******************************************************
//*11.2?? ????? *
//*????? ?? 1100012844 *
//*???2011?11?2? *
//*******************************************************
int main()
{
// days????????????
int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int w, i, a[13] = {0, 12}; // a??????1?1??i?13?????
cin >> w; // ??w
// ??1?1??i?13????????a[i]?
for (i = 1; i < 12; i++)
a[i + 1] = a[i] + days[i];
// ??a??
for (i = 1; i <= 12; i++)
if ((w + (a[i] % 7)) % 7 == 5) // ????
cout << i << endl; // ?????????i
return 0;
} | 50 |
24,664 | int main()
{
int a[12]={31,28,31,30,31,30,31,31,30,31,30,31},b[12],i,w;
scanf("%d",&w);
w=w+12;
for(i=0;i<12;i++)
b[i]=a[i]%7;
if(w%7==5) printf("1\n");
for(i=0;i<11;i++)
{
w=w+a[i];
if(w%7==5) printf("%d\n",i+2);
}
return 0;
}
| 50 |
24,665 | int main()
{
int w,m,d,a[12]={31,28,31,30,31,30,31,31,30,31,30,31};
scanf("%d",&w);
w=w+12;
if (w>7) w=w%7;
if (w==5) printf("1\n");
for (m=2;m<=12;m++){
w=w+a[m-2];
if (w>7) w=w%7;
if (w==5) printf("%d\n",m);
}
return 0;
} | 50 |
24,666 | main()
{
int w,i,j,k,c=0;
scanf("%d",&w);
c=7+w;
if(c%7==0)
printf("1\n");
for(i=1;i<12;i++)
{
if(i==1||i==3||i==5||i==7||i==8||i==10)
c=c+31;
if(i==4||i==6||i==9||i==11)
c=c+30;
if(i==28)
c=c+28;
if(c%7==0)
printf("%d\n",i+1);
}
return 0;
}
| 50 |
24,667 | //******************************
//**?????******************
//**??? 1300012728***********
//**2013.10.13******************
int main()
{
int w; // ????????
cin >> w;
int day = 12; // ?????????13??????
// ?????????
for (int i = 1; i <= 12; i++)
{
if ((w + day) % 7 == 5) // ????????i
cout << i << endl;
if (i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10)
day += 31; // ?????31????31
else if (i == 2) // ???2????28
day += 28;
else // ??????30
day += 30;
}
return 0;
} | 50 |
24,668 |
int main()
{
int i,j,w,month[13],week,sum_day=0;
scanf("%d",&w);
month[1]=31;
month[2]=28;
month[3]=31;
month[4]=30;
month[5]=31;
month[6]=30;
month[7]=31;
month[8]=31;
month[9]=30;
month[10]=31;
month[11]=30;
month[12]=31;
for(j=1;j<13;j++)
{
for(i=1;i<366;i++)
{
week = (i+w-1)%7;
if ((i-sum_day)==13 && week==5)
{
printf("%d\n",j);
}
}
sum_day += month[j];
}
return 0;
}
| 50 |
24,669 | void main()
{
int w,i,j,a[12][31],b[12][31],c[12*31],d[12*31];
scanf("%d",&w);
for(i=0;i<12;i++)
for(j=0;j<31;j++)
a[i][j]=j+1;
for(j=28;j<31;j++)
a[1][j]=0;
for(i=0;i<12;i++)
if(i==3 || i==5 || i==8 || i==10)
a[i][30]=0;
for(i=0;i<12*31;i++)
d[i]=a[i/31][(i+31)%31];
c[0]=w;
for(i=1;i<12*31;i++)
{
if(d[i]==0) c[i]=c[i-1];
else c[i]=c[i-1]+1;
if(c[i]>=8) c[i]=c[i]-7;
}
for(i=0;i<12*31;i++)
b[i/31][(i+31)%31]=c[i];
for(i=0;i<12;i++)
for(j=0;j<31;j++)
if(b[i][j]==5 && a[i][j]==13)
printf("%d\n",i+1);
}
| 50 |
24,670 | void bad(int w)
{int i,j,W;
W=w;
for(i=1;i<13;i++)
{switch(i)
{
case 1:
case 3:
case 5:
case 7:
case 8:
case 10:
case 12:
{for(j=1;j<32;j++)
{if(W==5&&j==13)
printf("%d\n",i);
if(W>6)
W=1;
else
W++;}
break;
}
case 4:
case 6:
case 9:
case 11:
{for(j=1;j<31;j++)
{if(W==5&&j==13)
printf("%d\n",i);
if(W>6)
W=1;
else
W++;}
break;
}
case 2:
{for(j=1;j<29;j++)
{if(W==5&&j==13)
printf("%d\n",i);
if(W>6)
W=1;
else
W++;}
break;
}
}}}
void main()
{
int w;
scanf("%d",&w);
bad(w);
}
| 50 |
24,671 |
int main()
{
int w,i,sum=0;
cin>>w;
for (i=0;i<=11;i++)
{
switch (i)
{
case 1:
case 3:
case 5:
case 7:
case 8:
case 10:sum+=31;break;
case 4:
case 6:
case 9:
case 11:sum+=30;break;
case 2:sum+=28;break;
default:sum+=0;break;
}
if ((sum+13+w-1)%7==5) cout<<i+1<<endl;
}
return 0;
}
| 50 |
24,672 |
int main()
{
int w, m = 1, day, a;
cin >> w;
day = 12;
do
{
if(m == 3)
day += 28;
else
{
if(m == 5 || m == 7 || m == 10 || m == 12)
day += 30;
else
if(m != 1)
day += 31;
}
a = day % 7;
if((a + w) % 7 == 5)
cout << m << endl;
m++;
}while(m <= 12);
return 0;
}
| 50 |
24,673 | int diji( int month, int day){
int i,s=0;
for(i=1;i<month;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){
s=s+28;
}
}
s=s+day;
return s;
}
int main(){
int n,days,mon,date,m,j;
scanf("%d",&n);
for(j=1;j<=12;j++){
days=0;
days=diji(j,13);
m=days%7;
if((m+n-1==5)||((m+n-1)%7==5)){
printf("%d\n",j);
}
}
return 0;
} | 50 |
24,674 | int main()
{
int w,i;
int m=0;
int t=0;
int a[15]={0,31,59,90,120,151,181,212,243,273,304,334};
scanf("%d",&w);
if(w>=1&&w<=5)
m=6-w;
else if(w>=6&&w<=7)
m=13-w;
for(i=0;i<=11;i++)
if((a[i]+13-m)%7==0)
{
t=i+1;
printf("%d\n",t);
}
return 0;
}
| 50 |
24,675 | /* title:?????*
* author:???*
* time:2011.10.28*/
int main()
{
int month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int day[13] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int week[13] = {0};
int weekday, i, j;
cin >> weekday;
for(i = 1; i <= 12; i ++)
{
for(j = 1; j < i; j++)
{
day[i] = day[i] + month[j];
}
day[i] = day[i] + 12;
week[i] = (day[i] % 7 + weekday) % 7;
if(week[i] == 5)
cout << i << endl;
}
return 0;
} | 50 |
24,676 |
int main()
{
int a[12][32],w,i,numOfDay,j; //a[i][j]??(i+1)?j?
//?????????????????????w?????
//????????numOfDay??????????
cin>>w;
a[0][1]=w;
for(i=0;i<12;i++){
switch(i){
case 0:
case 2:
case 4:
case 6:
case 7:
case 9:
case 11:numOfDay=31;break;
case 3:
case 5:
case 8:
case 10:numOfDay=30;break;
case 1:numOfDay=28;break;
}
for(j=1;j<=numOfDay;j++){ //?????
w=w%7; //????????
a[i][j]=w;
w++;
}
if(a[i][13]==5)
cout<<i+1<<endl;
}
return 0;
}
| 50 |
24,677 | //?????
int main()
{
int m2[12],b[12],c[12],w;
cin>>w;
for(int i=0;i<12;i++)
{
m2[i]=i+1;
switch(m2[i])
{
case 1:m2[i]=13;break;
case 2:m2[i]=31+13;break;
case 3:m2[i]=31+28+13;break;
case 4:m2[i]=31+28+31+13;break;
case 5:m2[i]=31+28+31+30+13;break;
case 6:m2[i]=31+28+31+30+31+13;break;
case 7:m2[i]=31+28+31+30+31+30+13;break;
case 8:m2[i]=31+28+31+30+31+30+31+13;break;
case 9:m2[i]=31+28+31+30+31+30+31+31+13;break;
case 10:m2[i]=31+28+31+30+31+30+31+31+30+13;break;
case 11:m2[i]=31+28+31+30+31+30+31+31+30+31+13;break;
case 12:m2[i]=31+28+31+30+31+30+31+31+30+31+30+13;break;
}
b[i]=(m2[i]-1)%7;
c[i]=(b[i]+w)%7;
if(c[i]==5)
{
m2[i]=i+1;
cout<<m2[i]<<endl;
}
}
return 0;
} | 50 |
24,678 | int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int sign=0;
int work(int n)
{
int s=12,i;
for(i=1;i<n;i++)
s+=a[i];
if((s+sign)%7==5)
return 1;
else
return 0;
}
int main()
{
int n,m,i;
cin>>sign;
for(i=1;i<=12;i++)
if(work(i))
cout<<i<<endl;
return 0;
}
| 50 |
24,679 | int main()
{
int n,week=0;
scanf("%d",&n);
int d[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int i,day[13],sum=0;
for(i=1;i<=12;i++)
{
day[i]=sum+13;
sum+=d[i];
week=(day[i]%7+n-1)%7;
if(week==5) printf("%d\n",i);
}
return 0;
}
| 50 |
24,680 | void main()
{
int n,w;
scanf("%d",&w);
if((12%7+w-7==5)||(12%7+w==5)) printf("1\n");
if((43%7+w-7==5)||(43%7+w==5)) printf("2\n");
if((71%7+w-7==5)||(71%7+w==5)) printf("3\n");
if((102%7+w-7==5)||(102%7+w==5)) printf("4\n");
if((132%7+w-7==5)||(132%7+w==5)) printf("5\n");
if((163%7+w-7==5)||(163%7+w==5)) printf("6\n");
if((193%7+w-7==5)||(193%7+w==5)) printf("7\n");
if((224%7+w-7==5)||(224%7+w==5)) printf("8\n");
if((255%7+w-7==5)||(255%7+w==5)) printf("9\n");
if((285%7+w-7==5)||(285%7+w==5)) printf("10\n");
if((316%7+w-7==5)||(316%7+w==5)) printf("11\n");
if((346%7+w-7==5)||(346%7+w==5)) printf("12\n");
}
| 50 |
24,681 |
int main(int argc, char* argv[])
{
int i, w, total[12], j;
scanf("%d",&w);
for(j=0; j<12; j++){
total[j]=12;
for( i=1; i<=j; i++)
{
if ( i ==1 || i==3 || i==5 || i==7 || i==8 || i==10 || i==12)
{
total[j] = total[j] +31;
}
if ( i ==4 || i==6 || i==9 || i==11)
{
total[j] = total[j] +30;
}
if ( i ==2)
{
total[j] = total[j] +28;
}
}
if(w<=5){
if(total[j]%7==(5-w)){
printf("%d\n",j+1);
}
}
if(w>5){
if(total[j]%7==(12-w)){
printf("%d\n",j+1);
}
}
}
return 0;
}
| 50 |
24,682 | int jh[365];
int xqj[365];
void dy(int *jh,int *xqj);
int main(){
int i;
for(i=0;i<31;i++){
jh[i]=i+1;
}
for(i=31;i<59;i++){
jh[i]=i-30;
}
for(i=59;i<90;i++){
jh[i]=i-58;
}
for(i=90;i<120;i++){
jh[i]=i-89;
}
for(i=120;i<151;i++){
jh[i]=i-119;
}
for(i=151;i<181;i++){
jh[i]=i-150;
}
for(i=181;i<212;i++){
jh[i]=i-180;
}
for(i=212;i<243;i++){
jh[i]=i-211;
}
for(i=243;i<273;i++){
jh[i]=i-242;
}
for(i=273;i<304;i++){
jh[i]=i-272;
}
for(i=304;i<334;i++){
jh[i]=i-303;
}for(i=334;i<365;i++){
jh[i]=i-333;
}
int w;
scanf("%d",&w);
for(i=0;i<365;i++){
xqj[i]=i+w;
if(xqj[i]%7!=0){
xqj[i]=xqj[i]%7;
}else{
xqj[i]=7;
}
}
dy(jh,xqj);
return 0;
}
void dy(int *jh,int *xqj){
int i;
int k=1;
for(i=0;i<365;i++){
if(jh[i]==13){
if(xqj[i]==5){
printf("%d\n",k);
}
k++;
}
}
} | 50 |
24,683 | int main()
{
int w,t,m,i;
m=0;
t=0;
scanf("%d",&w);
if(w>=1&&w<=7)
m=6-w;
else if(w>=6&&w<=7)
m=13-w;
int a[15]={0,31,59,90,120,151,181,212,243,273,304,334};
for(i=0;i<=11;i++)
if((a[i]+13-m)%7==0)
{t=i+1;
printf("%d\n",t);}
return 0;
}
| 50 |
24,684 |
int dijitian(int m,int d)
{
int q=0;
q=d;
switch(m)
{
case 12: q+=30;
case 11: q+=31;
case 10: q+=30;
case 9: q+=31;
case 8: q+=31;
case 7: q+=30;
case 6: q+=31;
case 5: q+=30;
case 4: q+=31;
case 3: q+=28;
case 2: q+=31;
case 1: q+=0;
}
return q;
}
int main()
{
int d,k,i,j;
scanf("%d",&k);
for(i=1;i<=12;i++)
{
d=dijitian(i,13);
j=d%7+k-1;
if (j>7) j-=7;
if (j==5) printf("%d\n",i);
}
return 0;
}
| 50 |
24,685 | void main()
{
int w,i,a[12];
scanf("%d",&w);
a[0]=w+5;
a[1]=w+1;
a[2]=w+1;
a[3]=w+4;
a[4]=w+6;
a[5]=w+2;
a[6]=w+4;
a[7]=w;
a[8]=w+3;
a[9]=w+5;
a[10]=w+1;
a[11]=w+3;
for(i=0;i<12;i++)
if(a[i]>7)a[i]=a[i]-7;
for(i=0;i<12;i++)
if(a[i]==5)
printf("%d\n",i+1);
}
| 50 |
24,686 | int main()
{
int dayofweek,days=12,mon[12],i,d,e;
scanf("%d",&dayofweek);
for(i=0;i<12;i++)
{
if(i==1)
mon[i]=28;
else if(i==3||i==5||i==8||i==10)
mon[i]=30;
else
mon[i]=31;
}
e=5-dayofweek;
if(e<0)
e+=7;
for(i=0;i<12;i++)
{
d=days%7;
if(d==e)
printf("%d\n",i+1);
days+=mon[i];
}
return 0;
} | 50 |
24,687 |
int main(){
int days=0,firstday;//days???????????firstday???????
cin>>firstday;
int month[12]={31,28,31,30,31,30,31,31,30,31,30,31};
for(int i=0;i<12;i++){
for(int j=0;j<i;j++) days=days+month[j];//?????????????
days=days+12+firstday;//????13???????????
if(days%7==5) cout<<i+1<<endl;
days=0;
}
} | 50 |
24,688 | int main()
{
int w,a[12]={31,28,31,30,31,30,31,31,30,31,30,31},i,b[13],c[13];
cin>>w;
b[0]=12;
for(i=1;i<13;i++)
{b[i]=b[i-1]+a[i-1];
c[i-1]=b[i-1]%7;
if((c[i-1]+w)%7==5)
cout<<i<<endl;
}
return 0;
}
| 50 |
24,689 | int count(int month)
{
int c[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int i,answer=0;
for(i=0;i<month;i++)
answer+=c[i];
answer+=13;
return(answer);
}
void main()
{
int t,w,a[13],i,b[13];
scanf("%d",&w);
for(i=1;i<=12;i++)
{
a[i]=count(i);
a[i]-=1;
}
t=7-w;
for(i=1;i<=12;i++)
{
b[i]=(a[i]-t)%7;
}
for(i=1;i<=12;i++)
{
if(b[i]==5)
printf("%d\n",i);
}
}
| 50 |
24,690 | int main()
{
int xq[365];
int i,w,f=0;
scanf("%d",&w);
for(i=0;i<365;i++){
xq[i]=(w+i)%7;
if(xq[i]==0)
xq[i]=7;
}
if(xq[12]==5){
if(f!=0)
printf("\n");
printf("1");
f++;
}
if(xq[43]==5){
if(f!=0)
printf("\n");
f++;
printf("2");
}
if(xq[71]==5){
if(f!=0)
printf("\n");
f++;
printf("3");
}
if(xq[102]==5){
if(f!=0)
printf("\n");
f++;
printf("4");
}
if(xq[132]==5){
if(f!=0)
printf("\n");
f++;
printf("5");
}
if(xq[163]==5){
if(f!=0)
printf("\n");
f++;
printf("6");
}
if(xq[193]==5){
if(f!=0)
printf("\n");
f++;
printf("7");
}
if(xq[224]==5){
if(f!=0)
printf("\n");
f++;
printf("8");
}
if(xq[255]==5){
if(f!=0)
printf("\n");
f++;
printf("9");
}
if(xq[285]==5){
if(f!=0)
printf("\n");
f++;
printf("10");
}
if(xq[316]==5){
if(f!=0)
printf("\n");
f++;
printf("11");
}
if(xq[346]==5){
if(f!=0)
printf("\n");
f++;
printf("12");
}
}
| 50 |
24,691 | int main()
{
int a,i,j,s;
int b[12]={0,31,28,31,30,31,30,31,31,30,31,30};
scanf("%d",&a);
if(a==7) printf("%d\n",1);
i=1;
while(i<=11)
{
s=0;
for(j=1;j<=i;j++)
{s=s+b[j];}
if((s+12)%7+a==5||(s+12)%7+a==12) printf("%d\n",i+1);
i=i+1;
}
return 0;
} | 50 |
24,692 | int main()
{
int w,a,b,i;
scanf("%d",&w);
for(i=1;i<=12;i++)
{
if(i==1)
{
a=12+w;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==2)
{
a=12+w+31;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==3)
{
a=12+w+31+28;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==4)
{
a=12+w+31+28+31;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==5)
{
a=12+w+31+28+31+30;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==6)
{
a=12+w+31+28+31+30+31;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==7)
{
a=12+w+31+28+31+30+31+30;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==8)
{
a=12+w+31+28+31+30+31+30+31;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==9)
{
a=12+w+31+28+31+30+31+30+31+31;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==10)
{
a=12+w+31+28+31+30+31+30+31+31+30;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==11)
{
a=12+w+31+28+31+30+31+30+31+31+30+31;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
if(i==12)
{
a=12+w+31+28+31+30+31+30+31+31+30+31+30;
b=a%7;
if(b==5)
{
printf("%d\n",i);
}
}
}
return 0;
} | 50 |
24,693 | int main()
{
int m,w;
scanf("%d",&w);
for(m=1;m<=12;m++)
{
if(m==1){
if((w+12)%7==5){
printf("1\n");
}
w+=12;
w+=31;
}
else if(m==3||m==5||m==7||m==8||m==10||m==12){
if(w%7==5){
printf("%d\n",m);
}
w+=31;
}
else if(m==2){
if(w%7==5){
printf("2\n");
}
w+=28;
}
else if(m==4||m==6||m==9||m==11){
if(w%7==5){
printf("%d\n",m);
;
}
w+=30;
}
};
return 0;
}
| 50 |
24,694 | int main()
{
int w,x,i,a[13];
scanf("%d",&w);
a[1]=13;
a[2]=44;
a[3]=72;
a[4]=103;
a[5]=133;
a[6]=164;
a[7]=194;
a[8]=225;
a[9]=256;
a[10]=286;
a[11]=317;
a[12]=347;
for(i=1;i<=12;i++)
{
x=a[i]%7;
if(x+w-1==5)
{
printf("%d\n",i);
}
else if(x+w-8==5)
{
printf("%d\n",i);
}
}
return 0;
}
| 50 |
24,695 | int main()
{
int w;
cin>>w;
int a[13],b[13];
a[0]=0,b[0]=0;
b[1]=31,b[3]=31,b[5]=31,b[7]=31,b[8]=31,b[10]=31,b[12]=31;
b[4]=30,b[6]=30,b[9]=30,b[11]=30,b[2]=28;
int i,j;
for (i=1;i<=12;i++)
{
for (j=1;j<=i;j++)
{
a[j]=a[j-1]+b[j-1];
}
}
for (i=1;i<=12;i++)
{
a[i]=a[i]+12;
}
for (i=1;i<=12;i++)
{
if ((w+a[i])%7==5)
{
cout<<i<<endl;
}
else
{
continue;
}
}
}
| 50 |
24,696 | main()
{
int w;
scanf("%d",&w);
int m[13];
m[0]=0;
m[1]=31;
m[2]=28;
m[3]=31;
m[4]=30;
m[5]=31;
m[6]=30;
m[7]=31;
m[8]=31;
m[9]=30;
m[10]=31;
m[11]=30;
m[12]=31;
int s=0;int p=1;
for(int j=1;j<13;j++)
{ int s=0;
for(int x=0;x<j;x++)
{
s=s+m[x];
}
s=s+13;
if(((s-1)%7+w%7)%7==5)
{
printf("%d\n",j);
}
}
}
| 50 |
24,697 | main()
{
int b[12],c[12],i,k,w;
scanf("%d",&w);
for(i=0;i<12;i++)
{
if(i==0||i==2||i==4||i==6||i==7||i==9||i==11)b[i]=31;
else
{
if(i==1)b[i]=28;
else b[i]=30;
}
}
c[0]=14;
for(i=0;i<12;i++)
{
if((c[i]+w)%7==0)
{printf("%d\n",i+1);}
c[i+1]=c[i]+b[i];
}
}
| 50 |
24,698 | int sushu(int b);
int main(){
int p;
scanf("%d",&p);
for(int i=1;i<=12;i++){
if((sushu(i)+p)%7==5)
printf("%d\n",i);
}
return 0;
}
int sushu(int b){
int i;
int a;
a=0;
for(i=1;i<=b;i++){
if(i==2||i==4||i==6||i==8||i==9||i==11)
a+=31;
else if(i==1)
a+=12;
else if(i==3)
a+=28;
else if(i==5||i==7||i==10||i==12)
a+=30;
}
return a;
} | 50 |
24,699 | int main()
{
int w;
cin>>w;
int m[13];
m[1]=w+12;
m[2]=m[1]+31;
m[3]=m[2]+28;
m[4]=m[3]+31;
m[5]=m[4]+30;
m[6]=m[5]+31;
m[7]=m[6]+30;
m[8]=m[7]+31;
m[9]=m[8]+31;
m[10]=m[9]+30;
m[11]=m[10]+31;
m[12]=m[11]+30;
for (int i=1;i<=12;i++)
{
if (m[i]%7==5)cout<<i<<endl;
}
} | 50 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.