[BZOJ4725][POI2017]Reprezentacje ró?nicowe

#pragma GCC optimize("O2")
#include <map>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
char buf[10000000], *ptr = buf - 1;
inline int readint(){
    int n = 0;
    while(*++ptr < ‘0‘ || *ptr > ‘9‘);
    while(*ptr <= ‘9‘ && *ptr >= ‘0‘) n = (n << 1) + (n << 3) + (*ptr++ & 15);
    return n;
}
int a[100], b[1000000], cnt = 0;
map<int, pair<int, int> > mp;
int main(){
    fread(buf, sizeof(char), sizeof(buf), stdin);
    mp.clear();
    a[1] = 1;
    a[2] = 2;
    mp[1] = make_pair(2, 1);
    int last, tot;
    for(last = 1, tot = 3; ; tot++){
        if(tot & 1) a[tot] = a[tot - 1] + a[tot - 1];
        else{
            while(mp.count(last)) last++;
            a[tot] = a[tot - 1] + last;
        }
        for(int j = 1; j < tot; j++)
            if(!mp.count(a[tot] - a[j]))
                mp[a[tot] - a[j]] = make_pair(tot, j);
        if(!(tot & 1) && a[tot] > 1000000000) break;
    }
    map<int, pair<int, int> >::iterator it;
    for(it = mp.begin(); it != mp.end(); ++it)
        b[++cnt] = it -> first;
    int n = readint(), x, y;
    while(n--){
        x = readint();
        if(mp.count(x)) printf("%d %d\n", mp[x].first, mp[x].second);
        else{
            y = lower_bound(b + 1, b + cnt + 1, x) - (b + 1);
            printf("%d %d\n", tot + (x - y) * 2, tot + (x - y) * 2 - 1);
        }
    }
    return 0;
}