Submission #1368036

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <sstream>
#include <algorithm>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000000;
 
int main() {
  ll y,m;
  cin >> y >> m;
  y-=2013;
  ll sum=y*12+m;
  ll l=0,r=MAX*2;
  while(l+1<r) {
    ll m=(l+r)/2;
    ll a;
    if(m%2) a=(12+m+13)/2*m;
    else a=m/2*(12+m+13);
    if(a<sum) l=m;
    else r=m;
  }
  ll z=sum;
  if(l!=0) {
    if(l%2) z-=(12+l+13)/2*l;
    else z-=l/2*(12+l+13);
  }
  cout << l+2013 << " " << z << endl;
  return 0;
}

Submission Info

Judge Result