Find Integer
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 41 Accepted Submission(s): 15
Special Judge
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 two integers n,a;(0≤n≤1000,000,000,3≤a≤40000)
Output
print two integers b,c if b,c exits;(1≤b,c≤1000,000,000);
else print two integers -1 -1 instead.
Sample Input
1
2 3
Sample Output
4 5
Source
勾股数规律:
首先是奇数组口诀:平方后拆成连续两个数。
其次是偶数组口诀:平方的一半再拆成差2的两个数
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define clr(a) memset(a,0,sizeof(a))
#define line cout << "------------" << endl
typedef long long ll;
const int maxn = 1e5 + 10;
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1010;
int main(){
int t;
scanf("%d",&t);
while(t--){
ll a, n;
scanf("%lld%lld", &n, &a);
if(n > 2 || n == 0) printf("-1 -1\n");
else{
ll b, c, s;
if(n == 1) printf("1 %lld\n", a+1);
else if(n == 2){
if(a%2 == 1){
b = a * a /2;
c = b + 1;
}
else{
s = a * a / 2;
b = s / 2 - 1;
c = s / 2 + 1;
}
printf("%lld %lld\n", b, c);
}
}
}
return 0;
}