結果
問題 | No.87 Advent Calendar Problem |
ユーザー |
|
提出日時 | 2017-10-16 10:21:41 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,292 bytes |
コンパイル時間 | 621 ms |
コンパイル使用メモリ | 79,196 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-17 20:39:22 |
合計ジャッジ時間 | 1,563 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <climits>#include <cmath>#include <string>#include <vector>#include <algorithm>#include <queue>#include <map>#include <functional>#include <set>#include <numeric>#include <stack>#include <utility>#include <time.h>#include <iterator>//#include "util.h"using namespace std;typedef unsigned uint;typedef long long lint;typedef unsigned long long ulint;//呪文template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second <<"}"; return ostr; }template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; }cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; } cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i];cout << "}"; }#define PI 3.14159265358979323846#define EPS 1e-12#define FOR(i,a,b) for(int i=(a);i<(b);++i)#define REP(i,n) FOR(i,0,n)#define all(x) (x).begin(), (x).end()bool leap(lint yr){if (yr % 4 != 0) return false;if (yr % 400 != 0 && yr % 100 == 0) return false;return true;}int yuki0087(){lint N;cin >> N;lint K, M;K = (N - 2014) / 400;M = (N - 2014) % 400;lint ans = 0, w = 0;for (lint yr = 2015; yr < 2015 + M; yr++) {w = (w + (leap(yr) ? 2 : 1)) % 7;if (w == 0) ans++;}ans += 57 * K;cout << ans << endl;return 0;}int main(){//clock_t start, end;//start = clock();yuki0087();//end = clock();//printf("%d msec.\n", end - start);return 0;}