結果
問題 | No.87 Advent Calendar Problem |
ユーザー |
![]() |
提出日時 | 2016-08-04 21:45:27 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,346 bytes |
コンパイル時間 | 1,519 ms |
コンパイル使用メモリ | 165,356 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-07 00:07:50 |
合計ジャッジ時間 | 2,480 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#include "bits/stdc++.h"using namespace std;typedef long long ll;typedef unsigned long long ull;typedef vector<int> veci;typedef vector<string> vecs;template<class T,class U> using Hash=unordered_map<T,U>;#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)#define rep(i, n) REP(i, 0, n)#define rrep(i, n) RREP(i, 0, n)#define MD 1000000007template<class T> T read(){T a;cin >> a;return a;}template<class T> void read(T& a){cin >> a;}template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}template<class T> void write(T a){cout << a << endl;}template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}void write(double a){cout << fixed << setprecision(12) << a << endl;}void write(long double a){cout << fixed << setprecision(12) << a << endl;}template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}bool is_uruu(int year){return (year%400==0)||(year%4==0&&year%100!=0);}int main(void){vector<int> w;int year=2001,week=0,ct=1;ll n;cin>>n;w.push_back(0);while(true){if(is_uruu(year))week+=2;else week+=1;week%=7;if(year%400==0&&week==0)break;w.push_back(w[ct-1]+(week==3));year++;ct++;}n-=2000;ll p=n/400;ll q=n%400;ll res=(*w.rbegin())*p-3;res+=w[q];write(res);return 0;}