Breaking News: Grepper is joining You.com. Read the official announcement!

Integer Moves codeforces solution

coder answered on March 22, 2022 Popularity 3/10 Helpfulness 2/10

answer Integer Moves codeforces solution

Integer Moves codeforces solution

Comment

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

void solve()
{
	int x, y;
	double ans;
	cin >> x >> y;
	ans = sqrt(pow(0 - x, 2) + pow(0 - y, 2));
	if (x == 0 && y == 0)
		cout << 0 << "\n";
	else if (ans == (int)ans)
		cout << 1 << "\n";
	else
		cout << 2 << "\n";
}

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}

Popularity 3/10 Helpfulness 2/10 Language cpp

Source: www.codegrepper.com

Tags: c++ integer solution

Link to this answer
Share Copy Link