Submission #2138240

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define EPS 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<pair<ll,ll> >seq[95];
vector<ll>cur;
vector<ll>fib;
void go(ll c){
	cur.pb(c);
	if(cur[cur.size()-1] >= fib[cur.size()-1]*2LL && cur[cur.size()-2] >= fib[cur.size()-2]*2LL) {
	    cur.pop_back(); return ;
	}
	for(ll i=1;i<=6;i++){
		if(c*i+cur[cur.size()-2] > 2000000000000000000LL){
			if(cur[cur.size()-1]+cur[cur.size()-2] > 2000000000000000000LL && !(cur[cur.size()-1] > fib[cur.size()-1]*2LL && cur[cur.size()-2] > fib[cur.size()-2]*2LL)){
				vector<ll>vi;
				for(int l=0;l+1<cur.size();l++){
					seq[l].pb(mp(cur[l],cur[l+1]));
				}
			}
			break;
		}
		go(c*i+cur[cur.size()-2]);
	}
	cur.pop_back();
}
P ans[15][15];
int rec(int a,int b){
	if(a<b) return rec(b,a);
	if(b==0) return 0;
	return rec(b,a%b)+1;
}
int main(){
    fib.pb(1); fib.pb(2);
    while(fib[fib.size()-2]+fib[fib.size()-1] <= 2000000000000000000LL){
        fib.pb(fib[fib.size()-2]+fib[fib.size()-1]);
    }
	cur.pb(1);
	go(2);
	go(3);
	go(4);
	go(5);
	rep(i,90){
		SORT(seq[i]);
		ERASE(seq[i]);
		//cout<<i<<" " <<seq[i].size()<<endl;
	}
	for(int i=1;i<=10;i++){
		for(int j=1;j<=10;j++){
			int mx=-1,num=0;
			for(int a=1;a<=i;a++){
				for(int b=1;b<=j;b++){
					if(mx == rec(a,b)){
						num++;
					}
					else if(mx < rec(a,b)){
						mx = rec(a,b); num = 1;
					}
				}
			}
			ans[i][j] = mp(mx,num);
		}
	}
	int q; cin>>q;
	rep(t,q){
		ll x,y; scanf("%lld%lld",&x,&y);
		if(x<=10 && y<=10){
			printf("%d %d\n",ans[x][y].fi,ans[x][y].sc);
			continue;
		}
		if(x>y) swap(x,y);
		if(x == 1){
			printf("1 %lld\n",y%mod);
			continue;
		}
		int mx = 0;
		for(int i=0;i<fib.size()-1;i++){
			if(fib[i]<=x && fib[i+1]<=y) mx = i+1;
		}
		assert(mx>=2);
		ll ret = 0;
		for(int i=0;i<seq[mx-2].size();i++){
			if(seq[mx-2][i].sc > x) continue;
			ll v = seq[mx-2][i].fi;
			ret += (y-v)/seq[mx-2][i].sc;
			ret %= mod;
			ret += (x-v)/seq[mx-2][i].sc;
			ret %= mod;
		}
		cout<<mx<<" "<<ret<<endl;
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:82:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   ll x,y; scanf("%lld%lld",&x,&y);
                                  ^

Judge Result