Submission #1216657
Source Code Expand
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int MOD = 1000000007;
const char ENDL = '\n';
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int days[]={0,31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int day(int m, int d){
int r=0;
FOR(i, 1, m){
r+=days[i];
}
r+=d;
return r;
}
int main(int argc, const char * argv[]) {
ios::sync_with_stdio(false);
std::cin.tie(0);
int ma,da,mb,db;
cin >> ma >> da >> mb >> db;
cout << day(mb, db) - day(ma, da) << ENDL;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 招待状 |
User |
NSTomoS |
Language |
C++14 (Clang 3.8.0) |
Score |
100 |
Code Size |
1890 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 |