CodeForces 633A之Ebony and Ivory

Description

Dante is engaged in a fight with "The Savior". Before he can fight it with his sword, he needs to break its shields. He has two guns, Ebony and Ivory, each of them is able to perform any non-negative number of shots.

For every bullet that hits the shield, Ebony deals a units of damage while Ivory deals b units of damage. In order to break the shield Dante has to deal exactlyc units of damage. Find out if this is possible.

Input

The first line of the input contains three integers a, b, c (1 ≤ a, b ≤ 100, 1 ≤ c ≤ 10 000) — the number of units of damage dealt by Ebony gun and Ivory gun, and the total number of damage required to break the shield, respectively.

Output

Print "Yes" (without quotes) if Dante can deal exactly c damage to the shield and "No" (without quotes) otherwise.

Sample Input

Input

4 6 15

Output

No

Input

3 2 7

Output

Yes

Input

6 11 6

Output

Yes

分析：输入三个数a，b，c；判断i*a+j*b==c是否成立，是输出YES，否则输出NO

AC代码如下：

#include "stdio.h"int main(int argc, char* argv[]){int a,b,c;int i,j,f;double y;while(scanf("%d%d%d",&a,&b,&c)!=EOF){f=0;for(i=0;i<=10000;i++){y=(double)(c-i*a)/b;if (y<0){break;}for (j=0;j<=10000;j++){if (y==j){f=1;break;}}}if (f){printf("YES\n");}else{printf("NO\n");}}return 0;}