|
int main()
{
for ( int A = 1; A <= 75; ++A)
{
for( int B = A; B <=75; ++B)
{
for( int C = B; C <=75; ++C)
{
for( int D = C; D <=75; ++D)
{
for( int E = D; E <=75; ++E)
{
for( int F = E; F <=75; ++F)
{
if ((A^5) + (B^5) + (C^5) +(D^5) + (E^5))== (F^5))
{
cout << "A = " << A << "B = " << B << "C = " << C << "D = " << D << "E = " << E << "F = " << F << endl;
}
}
}
}
}
}
}
}
This code is supposed to find the solution where (A^5) + (B^5) + (C^5) +(D^5) + (E^5)) = (F^5), and 0 < A <= B <= C <= D <= E <= F <= 75. Also, is there anyway to make it faster?
|
|
|
|
|
|
|
// |