Problem Description people in USSS love math very much, and there is a famous math problem . Input one line contains one integer T ;(1≤T≤1000000) Output print two integers b ,c if b ,c exits;(1≤b,c≤1000 ,000 ,000) ; Sample Input 1 2 3 Sample Output 4 5 费马大定理在加上勾股数的一些规律: 费马大定理: a^n+b^n=c^n在n>2时是不成立的。 勾股数规律: https://wenku.baidu.com/view/8282f1b669eae009591bec85.html #include <iostream> int main() |
Find Integer
猜你喜欢
转载自blog.csdn.net/weixin_40799464/article/details/82107016
今日推荐
周排行