HDU 6216 A Cubic number and A Cubic Number

最新推荐文章于 2019-08-02 00:35:26 发布

原创最新推荐文章于 2019-08-02 00:35:26 发布 · 526 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#HDU #6216 #A Cubic number and A

hdu oj 专栏收录该内容

122 篇文章

订阅专栏

本文探讨了如何判断一个素数是否可以表示为两个立方数之差的问题，并提供了一种有效的算法实现。通过数学推导简化了问题，利用特定公式进行高效计算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A Cubic number and A Cubic Number

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

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

Sample Output

  
   NO
NO
NO
YES
NO
NO
NO
YES
NO
NO

Source

2017 ACM/ICPC Asia Regional Qingdao Online

Recommend

liuyiding | We have carefully selected several similar problems for you: 6216 6215 6214 6213 6212

让求x^3-y^3=p是否成立，水了一下，ac

用一个数学公式水的

x^3-y^3
=(x^3-x^2*y)+x^2*y-(y^3-x*y^2)-x*y^2
=x^2(x-y)-y^2(y-x)+xy(x-y)

=(x-y)(x^2+xy+y^2)

ac代码：

#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
const int maxn=1e6+10;
ll t,n;

int main(){
	
	scanf("%lld",&t);
	while(t--){
		scanf("%lld",&n);
		ll i=1;
		int flag=0;
		ll aaaa;
		while(i <= maxn){
			aaaa=3*i*i+3*i+1;
			if(aaaa == n){
				flag=1;
				break ;
			}
			i++;
			if(aaaa > n)
				break ;
		}
		if(flag)
			printf("YES\n");
		else
			printf("NO\n");
	}		
	
	return 0;
}