UVA-408 Uniform Generator
来源:互联网 发布:墨客网络 编辑:程序博客网 时间:2024/06/05 21:06
2016-08-12
UVA - 408 Uniform Generator
题目大意:给出 step 和 mod,根据 seed(x+1)=[seed(x)+step]%10mod,问产生的随机数是否均匀分布于 0 到 mod-1。
解题思路:判断2个数是不是互质,用辗转相除法就好了。
#include <iostream>#include <cstdio>using namespace std;int gcd(int x, int y) {if (y == 0) return x;else return gcd(y, x % y);}int main() {int n, m;while ( ~scanf("%d%d", &n, &m) ) {printf("%10d%10d ", n, m);if (gcd(n,m) == 1) printf("Good Choice\n");else printf("Bad Choice\n");printf("\n");}return 0;}
0 0
- UVa 408 Uniform Generator
- uva 408 - Uniform Generator
- uva 408 - Uniform Generator
- uva-408 - Uniform Generator
- UVa 408 - Uniform Generator
- UVa 408 Uniform Generator
- Uva 408 - Uniform Generator
- uva 408Uniform Generator
- UVa 408 - Uniform Generator
- UVa 408: Uniform Generator
- uva 408 Uniform Generator
- UVA 408 Uniform Generator
- uva 408 - Uniform Generator
- uva 408 Uniform Generator
- uva 408 - Uniform Generator
- UVa 408 - Uniform Generator
- UVa 408 - Uniform Generator
- uva 408 Uniform Generator
- 8.12GDOI模拟赛总结
- android handler机制
- UVA-10250 The Other Two Trees
- Leetcode Maximum Depth of Binary Tree
- 调试机制
- UVA-408 Uniform Generator
- 很多C编译不支持bool型,导致出现false和true未定义
- box-shadow投影
- HDU 1008 Elevator 水题
- 很高兴加入CSDN,与大家共同学习
- JavaSE自学笔记整理(七)
- android studio 修改项目名称
- UVA-10879 Code Refactoring
- HDU 5256 序列变换