Start: Jun, 28, 2019 08:42:00
2019杭州师范大学第一届程序设计竞赛新生赛
End: Jun, 28, 2019 11:42:00
Time elapsed:
Time remaining:

Problem_ID: D
Result: Accepted
Time: 87ms
Memory: 1712kB
In contest: 1276

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 50;
int gcd(int x, int y)
{
	if(y == 0)return x; 
	if(x < y)swap(x, y);
	int t = x % y;
	x = y;
	y = t;
	return gcd(x, y);
}
int main()
{
	int n, q;
	scanf("%d %d", &n, &q);
	while(q--)
	{
		int a, b;
		scanf("%d %d", &a, &b);
		if(gcd(a, b) == 1)printf("1\n");
		else printf("2\n");
	}
	return 0;
}