Educational Codeforces Round 83 (Rated for Div. 2)------Two Regular Polygons

题目：
You are given two integers n and m (m
Your task is to say if it is possible to build another convex regular polygon with m vertices such that its center coincides with the center of the initial polygon and each of its vertices is some vertex of the initial polygon.
You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤104) — the number of test cases.
The next t lines describe test cases. Each test case is given as two space-separated integers n and m (3≤m

Output
For each test case, print the answer — “YES” (without quotes), if it is possible to build another convex regular polygon with m vertices such that its center coincides with the center of the initial polygon and each of its vertices is some vertex of the initial polygon and “NO” otherwise.

样例：

输入：
2
6 3
7 3
输出：
YES
NO

题意： 给定你一个正n边形，然后构造一个具有m顶点的凸正多边形，使得这两个正多边形的中心重合。如果可以构造，输出YES，否则输出NO。

题解： 签到题，只需要判断n%m是否为0即可

AC代码：

#include
using namespace std;
int main()
{
    int t; cin >> t;
    while(t--){
        int n, m; cin >> n >> m;
        if(n % m == 0)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}