Submission #8878658

---

Source Code Expand

//starusc
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int x=0,f=1;char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}
	return f==1?x:-x;
}
#define min_(a,b) (a>b?b:a)
#define pai pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
const int N=1e5+4,inf=1e18,mod=1e9+7;
int fei[100],cn;
vector<pai>a[100];
inline void init(){
	fei[1]=fei[2]=1;
	cn=2;
	while(fei[cn]<inf){
		++cn;
		fei[cn]=fei[cn-1]+fei[cn-2];
	}
	a[1].pb(mp(1,2));
	for(int i=2;i<=cn;i++){
		for(int j=0;j<(signed)a[i-1].size();j++){
			a[i].pb(mp(a[i-1][j].se,a[i-1][j].fi+a[i-1][j].se));
		}
		a[i].pb(mp(a[i][0].se,a[i][0].se*2-a[i][0].fi));
	}
}
signed main(){
	init();
	int u,v,mu,mv,mx,ans,T=read();
	while(T--){
		u=read();v=read();
		mu=upper_bound(fei+2,fei+cn+1,u)-fei-1;//<= 
		mv=upper_bound(fei+2,fei+cn+1,v)-fei-1;
		if(mu==mv)mv--;
		mx=min_(mu,mv);
		if(mx>1)mx--;
		cout<<mx<<" ";
		if(mx==1)cout<<(u%mod)*(v%mod)%mod;
		else{
			ans=0;
			for(int i=0,x,y;i<(signed)a[mx].size();i++){
				x=a[mx][i].fi;y=a[mx][i].se;
//				printf("%d %d sdlk\n",x,y);
				ans=(ans+((u>=y&&v>=x)?((u-y)/x+1):0)+((v>=y&&u>=x)?((v-y)/x+1):0))%mod;
			}
			cout<<ans;
		}
		puts("");
	}
	return (0-0);
}

Submission Info

Judge Result