CF1312A.Two Regular Polygons
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given two integers n and m ( m<n ). Consider a convex regular polygon of n vertices. Recall that a regular polygon is a polygon that is equiangular (all angles are equal in measure) and equilateral (all sides have the same length).
Examples of convex regular polygons 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.
输入格式
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<n≤100 ) — the number of vertices in the initial polygon and the number of vertices in the polygon you want to build.
输出格式
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.
输入输出样例
输入#1
2 6 3 7 3
输出#1
YES NO
说明/提示
The first test case of the example It can be shown that the answer for the second test case of the example is "NO".