題干：

Problem Statement

?

We ask you to select some number of positive integers, and calculate the sum of them.

It is allowed to select as many integers as you like, and as large integers as you wish. You have to follow these, however: each selected integer needs to be a multiple of?A, and you need to select at least one integer.

Your objective is to make the sum congruent to?C?modulo?B. Determine whether this is possible.

If the objective is achievable, print?YES. Otherwise, print?NO.

Constraints

?

• 1≤A≤100
• 1≤B≤100
• 0≤C<B

Input

?

Input is given from Standard Input in the following format:

A B C

Output

?

Print?YES?or?NO.

Sample Input 1

?

7 5 1

Sample Output 1

?

YES

For example, if you select?7?and?14, the sum?21?is congruent to?1?modulo?5.

Sample Input 2

?

2 2 1

Sample Output 2

?

NO

The sum of even numbers, no matter how many, is never odd.

Sample Input 3

1 100 97

Sample Output 3

YES

You can select?97, since you may select multiples of?1, that is, all integers.

Sample Input 4

40 98 58

Sample Output 4

YES

Sample Input 5

77 42 36

Sample Output 5

NO

解題報告：

?

AC代碼1：（找規(guī)律）

AC代碼2：（自己寫）

#include<cstdio> #include<queue> #include<string> #include<cstring> #include<cmath> #include<map> #include<iostream> #include<algorithm> #define ll long long const ll mod = 1e9+7; using namespace std; int a,b,c; int main() {while(~scanf("%d%d%d",&a,&b,&c)) {int flag = 0;for(int k = 1; k<=10000005; k++) {if((b*k+c) % a == 0) {printf("YES\n");flag = 1;break;}}if(!flag) printf("NO\n");}return 0 ; }

?

總結(jié)

以上是生活随笔為你收集整理的【AtCoder - 2554】Choose Integers （找规律，或枚举）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。