Submission #1153647
Source Code Expand
#include<bits/stdc++.h> #define range(i,a,b) for(int i = (a); i < (b); i++) #define rep(i,b) for(int i = 0; i < (b); i++) #define all(a) (a).begin(), (a).end() #define show(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; const int INF = 2000000000; using namespace std; bool isLeapYear(int y){ if(y % 400 == 0 || (y % 4 == 0 && y % 100 != 0 )) return true; else return false; } void nextMonth(int &y, int &m, int &d){ bool leapYear = isLeapYear(y); if((m == 2 && d == 30 && leapYear) || (m == 2 && d == 29 && !leapYear) || ((m == 4 || m == 6 || m == 9 || m == 11) && d == 31) || ((m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) && d == 32)){ m++; d = 1; } if(m == 13){ y++; m = 1; } } int main(){ int m,d,mm,dd; cin >> m >> d >>mm >> dd; int y = 2012; int cnt = 0; while(m != mm || d != dd){ cnt++; d++; nextMonth(y,m,d); } cout << cnt << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 招待状 |
User | noy72 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1158 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | input_0.txt, input_1.txt, input_10.txt, input_11.txt, input_12.txt, input_13.txt, input_14.txt, input_15.txt, input_16.txt, input_17.txt, input_18.txt, input_19.txt, input_2.txt, input_20.txt, input_21.txt, input_22.txt, input_23.txt, input_24.txt, input_25.txt, input_26.txt, input_27.txt, input_28.txt, input_29.txt, input_3.txt, input_30.txt, input_31.txt, input_32.txt, input_4.txt, input_5.txt, input_6.txt, input_7.txt, input_8.txt, input_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
input_0.txt | AC | 1 ms | 256 KB |
input_1.txt | AC | 1 ms | 256 KB |
input_10.txt | AC | 1 ms | 256 KB |
input_11.txt | AC | 1 ms | 256 KB |
input_12.txt | AC | 1 ms | 256 KB |
input_13.txt | AC | 1 ms | 256 KB |
input_14.txt | AC | 1 ms | 256 KB |
input_15.txt | AC | 1 ms | 256 KB |
input_16.txt | AC | 1 ms | 256 KB |
input_17.txt | AC | 1 ms | 256 KB |
input_18.txt | AC | 1 ms | 256 KB |
input_19.txt | AC | 1 ms | 256 KB |
input_2.txt | AC | 1 ms | 256 KB |
input_20.txt | AC | 1 ms | 256 KB |
input_21.txt | AC | 1 ms | 256 KB |
input_22.txt | AC | 1 ms | 256 KB |
input_23.txt | AC | 1 ms | 256 KB |
input_24.txt | AC | 1 ms | 256 KB |
input_25.txt | AC | 1 ms | 256 KB |
input_26.txt | AC | 1 ms | 256 KB |
input_27.txt | AC | 1 ms | 256 KB |
input_28.txt | AC | 1 ms | 256 KB |
input_29.txt | AC | 1 ms | 256 KB |
input_3.txt | AC | 1 ms | 256 KB |
input_30.txt | AC | 1 ms | 256 KB |
input_31.txt | AC | 1 ms | 256 KB |
input_32.txt | AC | 1 ms | 256 KB |
input_4.txt | AC | 1 ms | 256 KB |
input_5.txt | AC | 1 ms | 256 KB |
input_6.txt | AC | 1 ms | 256 KB |
input_7.txt | AC | 1 ms | 256 KB |
input_8.txt | AC | 1 ms | 256 KB |
input_9.txt | AC | 1 ms | 256 KB |