hdu4937（进制转换）

题意：给一个十进制n，在某种进制下它只包含3、4、5、6，问这样的进制有几种
思路：进制转化的题目，如果直接暴力方法，那么肯定会超时。n = a0 + a1*x + a2*x^2 + a3*x^3 +.....+ an*x^n(x是基数) (n)10 = (an an-1 ...a0)x
先考虑(n)10 = (a0)x的情况，a0 = n && x > 10, 那么只能是3,4,5,6， 而且情况有无数种；
在考虑(n)10 = (a1 a0)x的情况，n = a0+a1*x,然后解方程即可；
然后在考虑(n)10 = (a2 a1 a0)x的情况，n = a0 + a1*x + a2*x^2 ,然后解方程；

最后考虑x进制的n的位数大于3的情况，那么x <= 10000, 在考虑到ai只能取3,4,5,6，x <= 7000 , 接下来就是暴力了。

代码如下：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define LL __int64

#define inf 0x7ffffff
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
int a[4]={3,4,5,6};
LL n;
bool judge_twobit(int a0,int a1)
{
    if((n-a0)%a1 == 0)
    {
        LL x = (n-a0)/a1;
        if(x > a0 && x > a1)
            return true;
    }
    return false;
}
bool judge_threebit(int a0,int a1,int a2)
{
    LL a = a0;
    LL b = a1;
    LL c = 1LL*a2 - n;
    LL k = b*b - 4*a*c;
    if(k >= 0)
    {
        LL k1 = sqrt(1.0*k);
        if(k1*k1 == k)
            if((k1-b)%(2*a) == 0)
            {
                LL x = (k1-b)/2/a;
                if(x > a0 && x > a1 && x > a2)
                    return true;
            }
    }
    return false;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
    int t,z = 1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d",&n);
        printf("Case #%d: ",z++);
        if(n == 3 || n == 4 || n == 5 || n == 6)
        {
            printf("-1\n");
            continue;
        }
        int ans = 0;
        int i,j,k;
        for(i = 0; i < 4; i++)
            for(j = 0; j < 4; j++)
                if(judge_twobit(a[i],a[j]))
                    ans++;

        for(i = 0; i < 4; i++)
            for(j = 0; j < 4; j++)
                for(k = 0; k < 4; k++)
                    if(judge_threebit(a[i],a[j],a[k]))
                        ans++;
        //cout<<ans<<endl;
        for(i = 4; i <= 7000; i++)
        {
            LL n1 = n;
            int temp = 0, flag = 0;
            while(1)
            {
                temp++;
                if(n1 < i && (n1 == 3 || n1 == 4 || n1 == 5 || n1 == 6))
                        break;
                k = n1%i;
                if(k != 3 && k != 4 && k != 5 && k != 6)
                {
                    flag = 1;
                    break;
                }
                n1 /= i;
            }
            if(flag == 0 && temp > 3)
                ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}