CF1312A.Two Regular Polygons
入门
通过率:0%
时间限制:1.00s
内存限制:256MB
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.
给你两个整数 n 和 m(满足 m<n)。考虑一个具有 n 个顶点的凸正多边形。回忆一下,正多边形是指等角(所有内角大小相等)且等边(所有边长度相等)的多边形。
凸正多边形示例
你的任务是判断:能否构造另一个具有 m 个顶点的凸正多边形,使得它的中心与初始多边形的中心重合,且它的每个顶点都是初始多边形的某个顶点。
你需要回答 t 个相互独立的测试用例。
输入格式
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.
输入的第一行包含一个整数 t(1≤t≤104)—— 测试用例的数量。
接下来的 t 行描述测试用例。每个测试用例由两个以空格分隔的整数 n 和 m(3≤m<n≤100)给出,分别表示初始多边形的顶点数以及你希望构造的多边形的顶点数。
输出格式
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.
对于每个测试用例,如果能够构造另一个顶点数为 m 的凸正多边形,使得其中心与初始多边形的中心重合,且其每个顶点均为初始多边形的某个顶点,则输出答案 “YES”(不带引号);否则输出 “NO”。
输入输出样例
输入#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".
示例的第一个测试用例
可以证明,示例中第二个测试用例的答案为“NO”。
输入解题思路,AI测评打分。不知道怎么写?