两个相邻数的立方差为质数，隔一个数的立方差肯定不是质数

最新推荐文章于 2021-12-05 16:24:04 发布

哎呀呀呀呀呀呀

最新推荐文章于 2021-12-05 16:24:04 发布

阅读量1.3k

点赞数

分类专栏： C++ 数

本文链接：https://blog.csdn.net/weixin_42165786/article/details/81011264

版权

C++ 同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

数

8 篇文章 1 订阅

订阅专栏

A Cubic number and A Cubic Number

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 1946 Accepted Submission(s): 814

Problem Description

A cubic number is the result of using a whole number in a multiplication three times. For example,

3×3×3=27 so

27 is a cubic number. The first few cubic numbers are

1,8,27,64 and

125. Given an prime number

p. Check that if

p is a difference of two cubic numbers.

Input

The first of input contains an integer

T (1≤T≤100) which is the total number of test cases.
For each test case, a line contains a prime number

p (2≤p≤1012).

Output

For each test case, output 'YES' if given

p is a difference of two cubic numbers, or 'NO' if not.

Sample Input

   10 2 3 5 7 11 13 17 19 23 29 
 

Sample Output

NO NO NO YES NO NO NO YES NO

#include<bits/stdc++.h>
#define maxn 1000000
#define ll long long
using namespace std;
ll ans[maxn];
void init()
{
    ll i,cnt=0;
    for(i=2;i<maxn;i++)
    {
        ans[cnt++]=i*i*i-(i-1)*(i-1)*(i-1);
    }
}
int main()
{
    init();
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ll p;
        scanf("%lld",&p);
        int i;
        int flag=0;
        for(i=0;i<999997;i++)
        {
            if(p==ans[i])
            {
                flag=1;
                break;
            }
            if(p<ans[i]) break;
        }
        if(flag) printf("YES\n");
        else printf("NO\n");
    }
}