CodeForces 633A-Ebony and Ivory
来源:互联网 发布:黄心和绿心猕猴桃 知乎 编辑:程序博客网 时间:2024/06/06 04:51
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 dealsb units of damage. In order to break the shield Dante has to dealexactly 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 ≤ 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.
Print "Yes" (without quotes) if Dante can deal exactlyc damage to the shield and "No" (without quotes) otherwise.
4 6 15
No
3 2 7
Yes
6 11 6
Yes
In the second sample, Dante can fire 1 bullet from Ebony and2 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");elseprintf("No");printf("\n");}return 0;}
- Codeforces 633A Ebony and Ivory 【水题】
- CodeForces 633A-Ebony and Ivory
- CodeForces 633A之Ebony and Ivory
- 633A.Ebony and Ivory
- CodeForces 633 A.Ebony and Ivory(水~)
- A. Ebony and Ivory
- Manthan, Codefest 16 -A Ebony and Ivory
- CodeForces Manthan, Codefest 16 A Ebony and Ivory 扩展欧几里德(其实暴力直接搞就可以)
- 【Manthan, Codefest 16A】【水题 暴力】Ebony and Ivory ax+by=z
- codeforces A. Ciel and Robot
- codeforces --A - Sereja and Algorithm
- codeforces A. Vanya and Cards
- 【CODEFORCES】 A. Pashmak and Garden
- 【CodeForces】A. Mike and Frog
- codeforces A. Ilya and Diplomas
- Codeforces A. Vasya and Socks
- 【CODEFORCES】 A. Dreamoon and Sums
- 【CODEFORCES】 A. Dreamoon and Stairs
- poj 3026 Borg Maze
- Linux库函数之fgets
- Spring mvc+mybatis框架下的TooManyResultsException异常
- Android高效加载大图、多图解决方案,有效避免程序OOM
- java的static块执行时机
- CodeForces 633A-Ebony and Ivory
- 猜字母(字符串操作函数StringBuffer)
- 基于概率的矩阵分解原理详解(PMF)
- bzoj4416 阶乘字符串 子集dp
- Python与硬件学习笔记:蓝牙(一)
- linux环境下彻底卸载Pycharm的方法
- Codeforces Round #345 (Div. 2)(A)(记忆化搜索)
- Please use Android Tools > Fix Project Properties.
- CSS选择器的权重与优先规则