Educational Codeforces Round 125 (Rated for Div. 2) 1657A. Integer Moves Solution

Problem Link :  https://codeforces.com/contest/1657/problem/A 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,x,y,t;

    cin>>t;

    while(t--)

    {

        cin>>x>>y;

        if(x==0&&y==0)

            cout<<"0"<<endl;

        else

        {

            n=sqrt((x*x)+(y*y));

            if(((x*x)+(y*y))==(n*n))

            cout<<"1"<<endl;

            else

            cout<<"2"<<endl;

        }

    }

}