結果

問題 No.188 HAPPY DAY
ユーザー LayCurseLayCurse
提出日時 2015-04-22 00:01:44
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 1 ms / 1,000 ms
コード長 2,823 bytes
コンパイル時間 1,240 ms
コンパイル使用メモリ 145,628 KB
実行使用メモリ 4,376 KB
最終ジャッジ日時 2023-08-29 01:43:13
合計ジャッジ時間 1,720 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:36:95: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
 char *nameDayOfWeek[7]={"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
                                                                                               ^
main.cpp:36:95: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
main.cpp:36:95: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
main.cpp:36:95: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
main.cpp:36:95: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
main.cpp:36:95: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
main.cpp:36:95: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]

ソースコード

diff #

#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);}
void reader(double *x){scanf("%lf",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(double x, char c){printf("%.15f",x);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');}

char memarr[17000000]; void *mem = memarr;
#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};
char *nameDayOfWeek[7]={"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
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)++;
}

int sod(int c){
  return c/10 + c%10;
}

int main(){
  int i, j, k;
  int y=2015, m=1, d=1;

  int res = 0;
  while(y==2015){
    if(m==sod(d)) res++;
    nextDay(&y,&m,&d);
  }
  writerLn(res);

  return 0;
}
0