UVA 408 (暑假-数论 -D - Uniform Generator)
2014-07-22 08:42
344 查看
#include <cstdio> int main() { int n, m; while (scanf("%d%d", &n, &m) != EOF) { int count = 1; for (int i = 1; i <= n && i <= m; i++) { if (n % i == 0 && m % i == 0) count = i; } if (count == 1) printf("%10d%10d Good Choice\n\n", n, m); else printf("%10d%10d Bad Choice\n\n", n, m); } return 0; }
相关文章推荐
- UVA 10392 (暑假-数论- G - Factoring Large Numbers)
- UVA 575 (暑假-数论 -A - Skew Binary)
- UVA 550 (暑假-数论 -B - Multiplying by Rotation)
- UVA 568 (暑假-数论 -C - Just the Facts)
- UVA 350 (暑假-数论 -E - Pseudo-Random Numbers)
- UVA 10879 (暑假-数论 -H - Code Refactoring)
- 【暑假】[深入动态规划]UVa 10618 Fun Game
- UVA 123 (暑假-排序、检索(2)-B-Searching Quickly)
- UVA 138(数论)
- uva 10791 Minimum Sum LCM(数论)
- uva11404(数论_三角形计数)
- 数论寻找等差素数UVA 10650
- UVA 10006 Carmichael Numbers(数论+快速幂)
- uva 12050 - Palindrome Numbers(数论)
- UVA 11461 - Square Numbers(数论)
- UVA10079 - Pizza Cutting(数论)
- 【数论,水题】UVa 11728 - Alternate Task
- UVA——10139(数论)(挑战编程题目)
- UVA 1529 - Clock(数论)
- uva 10995 - Educational Journey(数论)