Ebony and Ivory

题意翻译

给定三个数a,b,c 判断不定方程 a * x + b * y == c 是否有整数解。存在输出“Yes”，否则为“No”。 @[yyy2015c01](/space/show?uid=5846) 翻译提供者：龙_之_谷

题目描述

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 exactly $ c $ units of damage. Find out if this is possible.

输入输出格式

输入格式

The first line of the input contains three integers $ a $ , $ b $ , $ c $ ( $ 1<=a,b<=100,1<=c<=10000 $ ) — 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.

输出格式

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

输入输出样例

输入样例 #1

4 6 15

输出样例 #1

No

输入样例 #2

3 2 7

输出样例 #2

Yes

输入样例 #3

6 11 6

输出样例 #3

Yes

说明

In the second sample, Dante can fire $ 1 $ bullet from Ebony and $ 2 $ from Ivory to deal exactly $ 1·3+2·2=7 $ damage. In the third sample, Dante can fire $ 1 $ bullet from ebony and no bullets from ivory to do $ 1·6+0·11=6 $ damage.

题意翻译

给定三个数a,b,c 判断不定方程 a * x + b * y == c 是否有整数解。存在输出“Yes”，否则为“No”。 @[yyy2015c01](/space/show?uid=5846) 翻译提供者：龙_之_谷