CodeForces 633A-Ebony and Ivory

小灰灰 2022-08-21 00:21 36阅读 0赞

A. Ebony and Ivory

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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.

Examples

Input

4 6 15

Output

No

Input

3 2 7

Output

Yes

Input

6 11 6

Output

Yes

Note

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.

#include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int main()
    {
    	int a,b,c;
    	while(scanf("%d%d%d",&a,&b,&c)!=EOF)
    	{
    		int xx,yy;
    		xx=c/a;
    		yy=c/b;
    		int i,j=0;
    		for(i=0;i<=xx;i++)
    		{
    			if((c-a*i)%b==0)
    			{
    				j=1;
    				break;
    			}
    		}
    		if(j==1)
    		printf("Yes");
    		else
    		printf("No");
    		printf("\n");
    	}
    	return 0;
    }

发表评论取消回复

表情：

评论列表（有 0 条评论，36人围观）

还没有评论，来说两句吧...

相关阅读

相关 Codeforces 633F 树的直径/树形DP

题意：有两个小孩玩游戏，每个小孩可以选择一个起始点，并且下一个选择的点必须和自己选择的上一个点相邻，问两个选的点权和的最大值是多少？思路：首先这个问题可以转化为求树上两不相

矫情吗；*/ 2023年08月17日 17:22/ 0 赞/ 148 阅读

相关【codeforce】Spongebob and Joke

![这里写图片描述][20160723111414780] ![这里写图片描述][20160723111423420] ![这里写图片描述][2016072311143

女爷i/ 2022年09月24日 02:27/ 0 赞/ 160 阅读

相关【codeforces】Pasha and Stick

![这里写图片描述][20160721230034639] ![这里写图片描述][20160721230050982] ![这里写图片描述][2016072123010

秒速五厘米/ 2022年09月24日 00:25/ 0 赞/ 186 阅读

相关【codeforces】Patrick and Shopping

![这里写图片描述][20160721223108163] ![这里写图片描述][20160721223120242] ![这里写图片描述][2016072122313

悠悠/ 2022年09月24日 00:25/ 0 赞/ 199 阅读

相关 CodeForces 633A-Ebony and Ivory

A. Ebony and Ivory time limit per test 2 seconds memory limit per test 256 megabytes

小灰灰/ 2022年08月21日 00:21/ 0 赞/ 37 阅读

相关 codeforces A. Ilya and Diplomas

[http://codeforces.com/contest/557/problem/A][http_codeforces.com_contest_557_problem_A]

小咪咪/ 2022年08月01日 18:19/ 0 赞/ 208 阅读

相关【codeforces】Bear and Three Balls

A. Bear and Three Balls time limit per test 2 seconds memory limit per test 256 mega

た入场券/ 2022年07月16日 23:42/ 0 赞/ 194 阅读

相关【codeforces】Dima and Guards

A. Dima and Guards time limit per test 1 second memory limit per test 256 megabytes

我会带着你远行/ 2022年07月16日 23:42/ 0 赞/ 71 阅读

相关【codeforces】 Bear and Reverse Radewoosh

A. Bear and Reverse Radewoosh time limit per test 2 seconds memory limit per test 25

系统管理员/ 2022年07月16日 23:41/ 0 赞/ 203 阅读

相关 CodeForces - 633C(字典树+dfs回溯)

C. Spy Syndrome 2 time limit per test 2 seconds memory limit per test 256 megabytes

缺乏、安全感/ 2022年05月28日 13:05/ 0 赞/ 214 阅读