Codeforces Round #451 (Div. 2) B. Proper Nutrition
来源:互联网 发布:mid函数的使用方法vb 编辑:程序博客网 时间:2024/06/03 07:00
B. Proper Nutrition
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it’s possible to buy some amount of bottles of Ber-Cola and Bars bars and spend exactly n burles.
In other words, you should find two non-negative integers x and y such that Vasya can buy x bottles of Ber-Cola and y Bars bars and x·a + y·b = n or tell that it’s impossible.
Input
First line contains single integer n (1 ≤ n ≤ 10 000 000) — amount of money, that Vasya has.
Second line contains single integer a (1 ≤ a ≤ 10 000 000) — cost of one bottle of Ber-Cola.
Third line contains single integer b (1 ≤ b ≤ 10 000 000) — cost of one Bars bar.
Output
If Vasya can’t buy Bars and Ber-Cola in such a way to spend exactly n burles print «NO» (without quotes).
Otherwise in first line print «YES» (without quotes). In second line print two non-negative integers x and y — number of bottles of Ber-Cola and number of Bars bars Vasya should buy in order to spend exactly n burles, i.e. x·a + y·b = n. If there are multiple answers print any of them.
Any of numbers x and y can be equal 0.
Examples
Input
7
2
3
Output
YES
2 1
Input
100
25
10
Output
YES
0 10
Input
15
4
8
Output
NO
Input
9960594
2551
2557
Output
YES
1951 1949
Note
In first example Vasya can buy two bottles of Ber-Cola and one Bars bar. He will spend exactly 2·2 + 1·3 = 7 burles.
In second example Vasya can spend exactly n burles multiple ways:
buy two bottles of Ber-Cola and five Bars bars;buy four bottles of Ber-Cola and don't buy Bars bars;don't buy Ber-Cola and buy 10 Bars bars.
In third example it’s impossible to but Ber-Cola and Bars bars in order to spend exactly n burles.
#include<bits/stdc++.h>using namespace std;int main(){ int n,a,b; cin>>n>>a>>b; for(int i=0;i*a<=n;++i)//自己这个地方是i<=n,错了,可能出现到负数的时候%b==0的情况 { if((n-i*a)%b==0) { int j=(n-i*a)/b; puts("YES"); printf("%d %d\n",i,j); exit(0); } } puts("NO"); return 0;}
- Codeforces Round #451 (Div. 2) B. Proper Nutrition
- Codeforces Round #451 (Div. 2) B. Proper Nutrition
- Codeforces Round #451 (Div. 2) Proper Nutrition 暴力枚举
- codeforces 898B. Proper Nutrition
- Proper Nutrition
- Codeforces Round #451 (Div. 2) A-B
- Codeforces Round #451 (Div. 2) B
- CF Codeforces Round #258 (Div. 2) B (451B)
- Codeforces Round #451 (Div. 2) B 拓展欧几里得
- Codeforces Round #451 (Div. 2) A-B 题解
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Codeforces Round #173 (Div. 2) Problem B
- Codeforces Round #181 (Div. 2) B. Coach
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #171 (Div. 2) B
- Codeforces Round #169 (Div. 2) B题
- 持续更新-爬虫网上练习记录
- Tomcat优化详解
- Boostrap学习笔记
- Android主题
- mysql存储过程
- Codeforces Round #451 (Div. 2) B. Proper Nutrition
- Gym
- java设计模式学习—抽象工厂模式
- Guava篇-缓存
- 浅谈TCP socket
- 二叉树遍历
- deepmind_lab 运行 ASSETS 和 MAPS文件依赖的东西
- LINTCODE——Compute 24 Game
- post与get 区别 (转载学习)