Submission #1372552

---

Source Code Expand

#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cassert>
#define repu(i,x,y) for (int i=x; i<=y; ++i)
using namespace std;

typedef long long LL;
const int p=1000000007;
int t,tot,ans;
LL n,m,f[100][2];

LL getLL()
{
    char ch;
    while (!isdigit(ch=getchar()));
    LL x=ch-'0';
    for (; isdigit(ch=getchar()); x=x*10+ch-'0');
    return x;
}

void dfs(LL x,LL y,int k)
{
    if (!k)
    {
        ans=(ans+(m-x-y)/y+1)%p;
        if (n>=x+y)
            ans=(ans+(n-x-y)/y+1)%p;
        return;
    }
    for (LL z=x+y*((!x)+1); z<=m; z+=y)
    {
        //assert(y*f[k][0]+z*f[k][1]>0 && y*f[k-1][0]+z*f[k-1][1]>0);
        if (y*f[k][0]+z*f[k][1]>m || y*f[k-1][0]+z*f[k-1][1]>n)
            break;
        if (z!=x+y*((!x)+1) && k>1)
            dfs(y*f[k-2][0]+z*f[k-2][1],y*f[k-1][0]+z*f[k-1][1],0);
        else
            dfs(y,z,k-1);
    }
}

void solve()
{
    n=getLL(),m=getLL();
    if (n>m)
        swap(n,m);
    for (tot=0; f[tot][1]<=n && f[tot+1][1]<=m; ++tot);
    if (--tot<=1)
    {
        printf("1 %d\n",n%p*m%p);
        return;
    }
    ans=0,dfs(0,1,tot-1);
    printf("%d %d\n",tot,ans);
}

int main()
{
    f[0][1]=f[1][0]=f[1][1]=1;
    repu(i,2,90)
        f[i][0]=f[i-1][0]+f[i-2][0],f[i][1]=f[i-1][1]+f[i-2][1];
    for (scanf("%d",&t); t--; solve());
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:51:32: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘LL {aka long long int}’ [-Wformat=]
         printf("1 %d\n",n%p*m%p);
                                ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:63:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for (scanf("%d",&t); t--; solve());
                        ^

Judge Result