输出三边在500以内的能构成直角三角形的数列

#include<iostream>
#include<cstring>
using namespace std;

//判断是否是直角三角形
bool isHardTriangle(int side1,int side2,int hypotenuse);

int main()
{
struct Triangle
{
int side1;
int side2;
int hypotenuse;
int flag;//决定该条数据是否显示 1为显示 0不显示
};

Triangle arr[500];

int counter=0;
for(int side1=3;side1<=500;side1++)
{
for(int side2=4;side2<=500;side2++)
{
for(int hypotenuse=5;hypotenuse<=500;hypotenuse++)
{
if(isHardTriangle(side1,side2,hypotenuse))
{
cout<<side1<<"\t"<<side2<<"\t"<<hypotenuse<<endl;
arr[counter].side1=side1;
arr[counter].side2=side2;
arr[counter].hypotenuse=hypotenuse;
arr[counter].flag=1;
counter++;
}
}
}
}

cout<<endl<<endl;

return 0;
}

bool isHardTriangle(int side1,int side2,int hypotenuse)
{
bool isHardTriangle=false;

if(side1*side1+side2*side2==hypotenuse*hypotenuse)
{
isHardTriangle=true;
}

return isHardTriangle;
}