题目来源
题目描述
题目解析
#include<bits/stdc++.h>
using namespace std;
bool isPrime(int a, int b){
if(a < b){
return isPrime(b, a);
}
if(a == b){
return false;
}
if(b == 0){
return a == 1 ;
}
return isPrime(b, a % b);
}
void process(int N, int M){
int count = 0;
for (int i = N; i <= M; ++i) {
for (int j = i + 1; j <= M; ++j) {
for (int k = j + 1; k <= M; ++k) {
if(i * i + j * j == k * k){
if(isPrime(i, j) && isPrime(i, k) && isPrime(j, k)){
count++;
std::cout << i << "\t" << j << "\t" << k << "\n";
}
}
}
}
}
if(count == 0){
std::cout << " NA " << "\n";
}
}
int main(int argc, char **argv)
{
process(1, 20);
}