51nod-1080 – Sum of squares of two numbers

ACM template

describe

Answer key

Pay attention to the scope of the search can be (set up a mark range of sentry), a water problem, no more words.

code

#include <iostream>
#include <cmath>

using namespace std;

int main(int argc, const char * argv[])
{
    int N;
    while (cin >> N)
    {
        int A;
        double B;
        double flag = N;
        bool tag = true;
        if (N == 1)
        {
            cout << "0 1\n";
            tag = false;
        }
        for (A = 1; A < flag; A++)
        {
            B = sqrt(N - A * A);
            flag = B;
            if (B == (int)B)
            {
                cout << A << ' ' << B << '\n';
                tag = false; }}if (tag)
        {
            cout << "No Solution\n"; }}return 0;
}
Copy the code