Mr. Panda and Geometric Sequence Gym - 101775D

https://cn.vjudge.net/problem/Gym-101775D

等比数列设：公比：q/p；

前三项：k*p^2;k*pq;k*q^2;

暴力枚举； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e6+2;
const int mod=1e9+7;


int n;
ll ten[20];
ll a[maxn*10];
int cnt=0;

int cal(ll x)
{
    int ans=0;
    while(x)
    {
        ans++;
        x/=10;
    }
    return ans;
}

ll join(ll x,ll y)
{
    return x*ten[cal(y)]+y;
}

void init()
{
    ten[0]=1;
    for(int i=1;i<=18;i++) ten[i]=ten[i-1]*10LL;

    for(int p=1;p<=(int)1e5;p++)
    {
        for(int q=p+1;q<=(int)1e5;q++)
        {
            if((ll)p*q>=(int)1e5) break;
            if(__gcd(p,q)>1) continue;


            for(int k=1;k<=(int)1e5/q/p;k++)
            {
                ll x=(ll)k*p*p;
                ll y=(ll)k*p*q;
                ll z=(ll)k*q*q;

                int len=cal(x)+cal(y)+cal(z);
                if(len>15) break;

                ll now=join(join(x,y),z);
                a[++cnt]=now;

                while(1)
                {
                    if(cal(z)>=9) break;
                    if(z*z%y) break;
                    ll nex=z*z/y;
                    int lennex=cal(nex);
                    if(len+lennex>15) break;
                    len+=lennex;
                    now=join(now,nex);
                    a[++cnt]=now;
                    y=z;
                    z=nex;
                }
            }
        }
    }
    sort(a+1,a+1+cnt);
}

ll solve(ll n)
{
    return upper_bound(a+1,a+1+cnt,n)-a-1;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    init();

    int T;

    int cas=0;

    //cin>>T;
    sfi(T);
    while(T--)
    {
        printf("Case #%d: ",++cas);
        ll r,l;
        sfl(l);
        sfl(r);
        printf("%lld\n",solve(r)-solve(l-1));
    }



    return 0;
}