#include<bits/stdc++.h> using namespace std; int main() { int T; scanf("%d",&T); while(T--) { int n,a; scanf("%d %d",&n,&a); ) printf(*a); ) { ||a==) printf(,-); else { ==) printf(,a*a/+); /-,a*a//+); } } else { print…

题目传送门 题目大意: 给出a和n,求满足的b和c. 思路: 数论题目,没什么好说的. 根据费马大定理,当n>2时不存在正整数解. 当n=0或者1时特判一下就可以了,也就是此时变成了一个求勾股数的问题. 勾股数的规律 1. 直角三角形短直角边为奇数,另一条直角边与斜边是两个连续自然数,则两边之和是短直角边的平方. a=2*n+1,b=2*n*(n+1),c=2*n*(n+1)+1.例如,(3.4.5),(5.12.13),(7.24.25).(9.40.41) 2. 大于2的任意偶数2n(n>…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6441 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Descriptionpeople in USSS love math very much, and there is a famous math problem .give you two integers n,a,…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6441(本题来源于2018年中国大学生程序设计竞赛网络选拔赛) 题意:输入n和a,求满足等式a^n+b^n=c^n的b,c的值 思路: 首先我们要知道什么是费马大定理 百度词条 费马大定理,又被称为“费马最后的定理”,由17世纪法国数学家皮耶·德·费马提出. 他断言当整数n >2时,关于x, y, z的方程 x^n + y^n = z^n 没有正整数解. 德国佛尔夫斯克曾宣布以10万马克作为奖金奖给在…

1002 Congruence equation 题目链接  : http://acm.hdu.edu.cn/showproblem.php?pid=6439 题解 : https://www.zybuluo.com/yang12138/note/1262592 相关定理 : 裴蜀定理 在数论中,裴蜀定理是一个关于最大公约数(或最大公约式)的定理.裴蜀定理得名于法国数学家艾蒂安·裴蜀,说明了对任何整数a.b和它们的最大公约数d,关于未知数x和y的线性丢番图方程(称为裴蜀等式): ax + by…

Find Integer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 6597    Accepted Submission(s): 1852Special Judge Problem Description people in USSS love math very much, and there is a famous math…

Problem Description people in USSS love math very much, and there is a famous math problem . give you two integers n,a,you are required to find 2 integers b,c such that an+bn=cn. Input one line contains one integer T;(1≤T≤1000000) next T lines contai…

Problem Description people in USSS love math very much, and there is a famous math problem .give you two integers n,a,you are required to find 2 integers b,c such that an+bn=cn. Input one line contains one integer T;(1≤T≤1000000)next T lines contains…

听队友说过结论:a^n + b^n = c^n在n > 2时无解. 勾股那里本菜数学不好直接暴举了Orz. 跟大家学一波勾股数的构造:a是奇数时,tmp = a / 2; b = (tmp + 1) * tmp * 2; c = b + 1; 举例:5.12.13. a是偶数时,tmp = a / 2 - 1; b = (tmp + 2) * tmp; c = b + 2; 举例:8.15.17. #include <cstdio> #include <cmath> int…

问题传送门:https://vjudge.net/contest/320779#problem/D 介绍一个名词:奇偶数列法则 Key part: #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> using namespace std; #define ll long long int main() { int t; ll a,b,c,n; scanf(&qu…