A. Two Regular Polygons

水题,判断大小正多边形的中心是否重合.
思路:判断n能否整除m即可.

附ac代码:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(int argc, char const *argv[])
{
	ll t;
	cin >> t;
	for (int i = 0; i < t; ++i)
	{
		ll m, n;
		cin >> n >> m;
		if (n % m == 0)  cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return 0;
}