URAL 1430. Crime and Punishment(数论)
2014-11-28 21:22
295 查看
题目链接
题意 :给你a,b,n,让你找出两个数x,y,使得n-(a*x+b*y)最小。
思路 : 分大小做,然后枚举a的倍数
View Code
题意 :给你a,b,n,让你找出两个数x,y,使得n-(a*x+b*y)最小。
思路 : 分大小做,然后枚举a的倍数
#include <stdio.h> #include <string.h> #include <iostream> #define LL __int64 using namespace std ; int main() { LL a,b,n ; while(~scanf("%I64d %I64d %I64d",&a,&b,&n)) { if(a == 1) { printf("%I64d 0\n",n) ; continue ; } if(b == 1) { printf("0 %I64d\n",n) ; continue ; } bool flag = false ; if(a < b) { swap(a,b) ; flag = true ; } LL t = min(n/a,b) ,x; LL minn = 999999999LL ; for(int i = 0; i <= t ; i++) { if((n - a * i) % b < minn) { minn = (n - a * i) % b ; x = i; } } if(!flag) printf("%I64d %I64d\n",x,(n-a*x)/b) ; else printf("%I64d %I64d\n",(n-a*x)/b,x) ; } return 0 ; }
View Code
相关文章推荐
- Ural 1430. Crime and Punishment(数论)
- Ural 1430. Crime and Punishment
- URAL 1430 Crime and Punishment
- 1430. Crime and Punishment(枚举)
- 1430. Crime and Punishment
- Ural2102:Michael and Cryptography(数论&素数)
- 1.4 Crime and Punishment
- Crime and Punishment
- Ural 2063 Black and White
- 【数论】[CF258C]Little elephant and LCM
- codeforces 66 D. Petya and His Friends(数论)
- Codeforces #280 Div.2 E.Vanya and Field 数学,数论
- G - Mnemonics and Palindromes 3 URAL - 1737(回文)
- URAL 2040 Palindromes and Super Abilities 2 (回文自动机)
- URAL 1635. Mnemonics and Palindromes(简单区间dp)
- codeforces 276D D. Little Girl and Maximum XOR(贪心+dp+数论)
- Uva10375 Choose and divide(数论、唯一分解定理、快速幂)
- URAL 2040 Palindromes and Super Abilities 2(回文树)
- URAL 2067 Friends and Berries (推理,数学)
- 【LightOJ1282】Leading and Trailing(数论)