Submission #1372567

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#define ll long long
#define MN 500
using namespace std;
ll read_p,read_ca,read_f;
inline ll read(){
	read_p=0;read_ca=getchar();read_f=1;
	while (read_ca<'0'||read_ca>'9') read_f=read_ca=='-'?-1:read_f,read_ca=getchar();
	while (read_ca>='0'&&read_ca<='9') read_p=read_p*10+read_ca-48,read_ca=getchar();
	return read_p*read_f;
}
int T;
const ll M=1e18;
const int MOD=1e9+7;
struct na{ll x,y;}S[MN][MN];
ll n,m,F[MN],mmh,MMH;
int main(){
	T=read();
	F[0]=F[1]=1;
	for (ll i=2;(F[i]=F[i-1]+F[i-2])<=M;i++);
	S[0][0].x=S[0][0].y=1;
	for (ll i=1;F[i]<=M;i++){
		for (ll j=0;j<i;j++) S[i][j].x=S[i-1][j].x+S[i-1][j].y,S[i][j].y=S[i-1][j].x;
		S[i][i].x=F[i+2];S[i][i].y=F[i];
	}
	while(T--){
		n=read();m=read();
		if (n==1&&m==1) {printf("1 1\n");continue;}
		if (n<m) swap(n,m);
		mmh=1;
		while (F[mmh+2]<=n&&F[mmh+1]<=m) mmh++;
		printf("%lld ",mmh);mmh--;
		MMH=0;
		for (ll i=0;i<=mmh;i++){
			if (m>=S[mmh][i].x) (MMH+=(n-S[mmh][i].y)/S[mmh][i].x)%=MOD;
			if (n>=S[mmh][i].x) (MMH+=(m-S[mmh][i].y)/S[mmh][i].x)%=MOD;
		}
		printf("%lld\n",(MMH+(mmh?0:m))%MOD);
	}
}

Submission Info

Judge Result