HDU4282 A very hard mathematic problem 快速幂

最新推荐文章于 2019-07-24 12:56:31 发布

misaka233

最新推荐文章于 2019-07-24 12:56:31 发布

阅读量429

点赞数

本文链接：https://blog.csdn.net/sinat_21243261/article/details/47061875

版权

问题描述：

Haoren is very good at solving mathematic problems. Today he is working a problem like this:
　　Find three positive integers X, Y and Z (X < Y, Z > 1) that holds
　　 X^Z + Y^Z + XYZ = K
　　where K is another given integer.
　　Here the operator “^” means power, e.g., 2^3 = 2 * 2 * 2.
　　Finding a solution is quite easy to Haoren. Now he wants to challenge more: What’s the total number of different solutions?
　　Surprisingly, he is unable to solve this one. It seems that it’s really a very hard mathematic problem.
　　Now, it’s your turn.

输入：

There are multiple test cases.
　　For each case, there is only one integer K (0 < K < 2^31) in a line.
　　K = 0 implies the end of input.
输出：

Output the total number of solutions in a line for each test case.

样例输入：

样例输出：

思路：听说别人是二分做的。。。。然而我写了个快速幂暴力枚举就过了。。。。。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
long long pow(long long a,int n)
{
    long long int z=1;
    long long temp=a;
    while(n)
    {
        if(n&1) z*=temp;
        temp*=temp;
        n>>=1;
    }
    return z;
}

int main()
{
    long long k;
    long long ans;
    while(scanf("%I64d",&k)&&k)
    {
        ans=0;
        long long temp=(long long)sqrt(k);
        if(temp*temp==k)ans+=(temp-1)/2;//完全平方数可分解为x^z+y^z+xyz........弄了几个例子就用了，评论区就大神证明或者指错...
        for(int z=3;z<31;z++)
        {
            for(long long x=1;;x++)
            {
                long long u=pow(x,z);
                if(u*2>=k) break;
                for(long long y=x+1;;y++)
                {
                    long long v=pow(y,z);
                    if(u+v+x*y*z>k) break;
                    if(u+v+x*y*z==k) ans++;
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}