Submission #1551913

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000
#define ll __int128

int main(){
  long y,m;
  cin>>y>>m;

  ll elapsed = (y-2013)*12 + m;

  ll l = 2012, r = y+1;
  while(r-l>1){
    ll mid = (l+r)/2;

    if( (mid-2012)*(mid-2000 + 13) / 2 <= elapsed ) l = mid;
    else r = mid;
  }

  long Y = l+1;
  long M = (elapsed - (l-2012)*(l-2000 + 13) / 2);
  if(M==0){
    Y--;
    M = Y - 2000;
  }
  assert(Y-2000 >= M);

  cout << Y << " " << M << endl;

  return 0;
}

Submission Info

Judge Result