总结:
1、素勾股数的算法·要记住!
for (int n = 1; n <= 32; n++) {
for (int m = n + 1; m <= 32; m++) {
if (gcd(m, n) - 1) continue; //gcd(m, n) - 1 对偶逻辑 gcd(m, n) != 1
int a = m * m - n * n;
int b = 2 * m * n;
int c = m * m + n * n;
}
}
总结:
1、素勾股数的算法·要记住!
for (int n = 1; n <= 32; n++) {
for (int m = n + 1; m <= 32; m++) {
if (gcd(m, n) - 1) continue; //gcd(m, n) - 1 对偶逻辑 gcd(m, n) != 1
int a = m * m - n * n;
int b = 2 * m * n;
int c = m * m + n * n;
}
}