سیانەی پیتاگۆرسی

for(int i=1;i<max;i++)     for(int j=i;j<max;j++)         for(int k=j;k<max;k++)             if(((i*i) + (j*j)) == (k*k) )                 cout<<i*i<<" + "<<j*j<<" = "<<k*k; 

// تابع findPythTriplet  vector<long long int> findPythTriplet(long long int until) {     long long int s=until,s2=s/2,m,sm,k,d,n,a,b,c;     long long int mLimit=(long long int)sqrt((double)s2);     vector<long long int> results;     for(m=2;m<=mLimit;m++)     {         if(s2%m==0)         {             sm=s2/m;             while(sm%2==0)             {                 sm = sm/2;             }             if(m%2==1)             {                 k=m+2;             }             else             {                 k=m+1;             }             while (k<(2*m) && k<=sm)             {                 if(sm%k==0 && gcd(k,m)==1)                 {                     d=s2/(k*m);                     n=k-m;                     a=d*(m*m-n*n);                     b=2*d*m*n;                     c=d*(m*m+n*n);                     results.push_back(a);                     results.push_back(b);                     results.push_back(c);                 }                 k+=2;             }         }     }     return results; }