暴力是可以过的
哈希表 O (N^2)
根据题目范围推断出应该是只能循环两层
哈希的做法就是用unordered_map 记录一下两层 用到的两个元素的值 和 平方和
#include<bits/stdc++.h>
#include <unordered_map>
#define x first
#define y second
using namespace std;
typedef pair<int, int> PII;
const int N = 2500010;
int n, m;
unordered_map<int, PII> S;
int main()
{
cin >> n;
for (int c = 0; c * c <= n; c++)
for (int d = c; c * c + d * d <= n; d++)
{
int t = c * c + d * d;
if (S.count(t) == 0) S[t] = { c, d };
}//这样也保证了升序(题目对于输出的要求
for (int a = 0; a * a <= n; a++)
for (int b = 0; a * a + b * b <= n; b++)
{
int t = n - a * a - b * b;
if (S.count(t))
{
printf("%d %d %d %d\n", a, b, S[t].x, S[t].y);
return 0;
}
}
return 0;
}
二分
O(N^ 2 * logN)
#include<bits/stdc++.h>
using namespace std;
const int N = 2500010;
int n, x;
struct Sum
{
int s, a, b;
bool operator < (const Sum& t) const
{
if (s != t.s) return s < t.s;
if (a != t.a) return a < t.a;
else return b < t.b;
}
}sum[N];
int main()
{
cin >> n;
int a, b;
for (int a = 0;a*a <= n;a++)
for (int b = a;a * a + b * b <= n;b++)
sum[x++] = { a * a + b * b,a,b };
sort(sum,sum+x);
for (int p = 0;p * p <= n;p++)
for (int q = p;q * q+ p * p <= n;q++)
{
int sum1 = n - p * p - q * q;
int l = 0, r = x-1;//这里是最后执行完x++后多加了个1
while (l < r)
{
int mid = l + r>> 1;
if (sum[mid].s >=sum1) r = mid;
else l = mid + 1;
}
if (sum[l].s == sum1)
{
cout << p << " " << q << " " << sum[l].a << " " << sum[l].b;
system("pause");
return 0;
}
}
return 0;
}