Submission #4243059

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  vector<int> days{0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  FOR(i, 1, 12) days[i] += days[i-1];
  int ma, da, mb, db; cin >> ma >> da >> mb >> db;
  cout << (days[mb-1] + db) - (days[ma-1] + da) << '\n';
  return 0;
}

Submission Info

Judge Result