题目:找到小于N的勾股数组的朴素解(三个数互质),并找到[1, N]中所有勾股数组中未出现过的数字个数。
分析:数论。这里直接利用《原本》中的解法即可。
x = 2st,y = s^2 - t^2,z = s^2 + t^2,
其中:1.s > t;(枚举顺序)
2.s和t互质;(朴素解)
3.s和t奇偶性不同;(反证法证明)
在计算未出现的数字时,需要枚举朴素解的倍数。
说明:伟大的欧几里得╮(╯▽╰)╭。
#include <cstring>
#include <cstdio>
#include <cmath>
// x = 2st, y = s^2-t^2, z = s^2+t^2
int gcd(int a, int b)
{
return a%b?gcd(b, a%b):b;
}
int visit[1000001];
int main()
{
int N, x, y, z;
while (~scanf("%d",&N)) {
memset(visit, 0, sizeof(visit));
int maxt = (int)sqrt(N+0.0), count = 0;
for (int t = 1; t <= maxt; ++ t) {
int maxs = (int)sqrt(0.0 + N - t*t);
if (maxs > maxt) maxs = maxt;
for (int s = t+1; s <= maxs; ++ s)
if (s%2 != t%2 && gcd(s, t) == 1) {
count ++;
x = 2*s*t;
y = s*s - t*t;
z = s*s + t*t;
//求解非朴素解
for (int k = 0; k*z <= N; ++ k)
visit[x*k] = visit[y*k] = visit[z*k] = 1;
}
}
int p = 0;
for (int i = 1; i <= N; ++ i)
p += (visit[i]==0);
printf("%d %d\n",count, p);
}
return 0;
}