当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3113：Sum of Cubes

题目描述
According to Goldbach’s conjecture, every even number can be expressed as a sum of two odd primes. Which numbers can be expressed as the sum of two cubes?

输入解释
For each test case, a line will contain a positive integer n which will be at most one million.

The last line will contain the integer 0, which should not be processed.
输出解释
For each test case, output two integers x and y such that x3 + y3 = n. If there are many such pairs of numbers, choose x to be as small as possible. If there are no such pairs, output “Impossible”.

输入样例 
1
2
3
1000000
0
输出样例 
0 1
1 1
Impossible
0 100
来自杭电HDUOJ的附加信息
Recommend lcy
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 IPCP 2005 Northern Preliminary for Northeast North-America
源链接： HDU-3113
最后修改于 2020-10-25T23:00:10+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)