#include <cstdio>
#include <algorithm>
using namespace std;
const int p=1000000007;
long long f[200],f_[200];
long long m,n;
int h,i,s,t;
inline void dfs(int x,int y,long long u,long long v,long long su,long long sv)
{
if (x==y-1)
{
s=(s+(m-u)/v)%p;
s=(s+(n-u)/v)%p;
}
else
{
long long tu,tv,tw;
for (int k=1;;k++)
{
tu=v,tv=k*v+u;
tu=su+(k-1)*v*f_[y-x-2];
tv=sv+(k-1)*v*f_[y-x-1];
if ((tu>n) || (tv>m))
break;
dfs(x+1,y,v,k*v+u,tu,tv);
}
}
return;
}
int main()
{
f[0]=0,f[1]=1,f[2]=2;
for (i=3;i<=100;i++)
f[i]=f[i-1]+f[i-2];
f_[0]=1,f_[1]=1;
for (i=2;i<=100;i++)
f_[i]=f_[i-1]+f_[i-2];
scanf("%d",&t);
for (h=1;h<=t;h++)
{
scanf("%lld%lld",&n,&m);
if (n>m)
swap(n,m);
if ((n==1) && (m==1))
{
printf("%d %d\n",1,1);
continue;
}
for (i=0;(f[i]<=n) && (f[i+1]<=m);i++);
printf("%d ",i-1);
if (i-1==1)
printf("%lld\n",(m%p)*(n%p)%p);
else
{
s=0;
dfs(0,i-1,1,1,f[i-1],f[i]);
printf("%d\n",s);
}
}
return 0;
}
./Main.cpp: In function ‘int main()’:
./Main.cpp:43:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&t);
^
./Main.cpp:46:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&n,&m);
^