#4919 (C++11) No.87 Advent Calendar Problem

• 問題: No.87 Advent Calendar Problem
• ユーザー: LayCurse
• 提出日時: 2014-12-07 00:06:48
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 19 ms / 5,000 ms
• コード長: 2,762 bytes
• コンパイル時間: 1,433 ms
• コンパイル使用メモリ: 159,496 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-11 15:52:15
• 合計ジャッジ時間: 2,105 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	7 ms; 5,248 KB
testcase_01	AC	14 ms; 5,376 KB
testcase_02	AC	4 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	9 ms; 5,376 KB
testcase_07	AC	11 ms; 5,376 KB
testcase_08	AC	7 ms; 5,376 KB
testcase_09	AC	9 ms; 5,376 KB
testcase_10	AC	11 ms; 5,376 KB
testcase_11	AC	14 ms; 5,376 KB
testcase_12	AC	17 ms; 5,376 KB
testcase_13	AC	12 ms; 5,376 KB
testcase_14	AC	19 ms; 5,376 KB
testcase_15	AC	10 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	11 ms; 5,376 KB
testcase_21	AC	10 ms; 5,376 KB
testcase_22	AC	8 ms; 5,376 KB
testcase_23	AC	7 ms; 5,376 KB
testcase_24	AC	8 ms; 5,376 KB
testcase_25	AC	4 ms; 5,376 KB
testcase_26	AC	18 ms; 5,376 KB

ソースコード

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

#define MD 1000000007

int isLeapYear(int y){if(y%400==0)return 1;if(y%100==0)return 0; if(y%4==0)return 1; return 0;}
int numberOfDaysInMonth[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
void nextDay(int *year,int *month,int *day){
  if((*day) < numberOfDaysInMonth[*month] || ((*month)==2 && isLeapYear(*year) && (*day)==28)){
    (*day)++; return;
  }
  (*day)=1; if((*month)==12) (*year)++, (*month)=1; else (*month)++;
}


ll lim;
int main(){
  int i, j, k;
  int Y, M, D;
  int res = 0;

  reader(&lim);
  Y = 2014; M = 7; D = 23;

  while(lim > 2600){
    res += 57;
    lim -= 400;
  }

  k = 0;
  for(;;){
    if(Y > lim) break;
    nextDay(&Y,&M,&D);
    k=(k+1)%7;
    if(M==7 && D==23 && k==0) res++;
  }
  writerLn(res);

  return 0;
}