UVA 471 Magic Numbers(枚举)
2015-04-22 16:47
357 查看
题意:
s1/s2=Ns1/s2=N,s1、s2、N都是各个位数上数字不相同的整数。给定N,求有多少个这样的式子并输出。
思路:
其实最大的数只能是9876543210,所以我们只要暴力枚举s2,枚举过程中判断s1、s2是否符合题目要求即可。AC代码
[code]#include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <cstdlib> using namespace std; typedef long long ll; const ll MAX = 9876543210; ll num; bool vis[10]; bool judge(ll x) { if(x > MAX) return false; memset(vis, false, sizeof(vis)); while(x) { if(vis[x%10]) return false; vis[x%10] = true; x /= 10; } return true; } int main() { int T; ll div, factor; scanf("%d", &T); while(T--) { scanf("%lld", &num); div = 0; for(ll i = 1; div <= MAX; i++) { factor = i, div = factor*num; if(judge(div) && judge(factor)) printf("%lld / %lld = %lld\n", div, factor, num); } if(T) puts(""); } return 0; }
相关文章推荐
- UVa 471 Magic Numbers (枚举)
- uva 471 - Magic Numbers(枚举技巧)
- uva 471 - Magic Numbers(搜索)
- uva - Magic Numbers(枚举、位运算)
- UVa:471 Magic Numbers
- UVA - 471 Magic Numbers
- UVA471- Magic Numbers
- UVa 471 - Magic Numbers
- UVA 11205 The broken pedometer(子集枚举)
- uva 1301 - Fishnet(几何+枚举)
- UVa 1509 Leet 枚举
- uva 10730 - Antiarithmetic?(枚举)
- UVa 1151 (枚举 + MST) Buy or Build
- UVA - 11181 Probability|Given 概率 + 递归枚举子集
- uvalive4836(枚举)
- UVA - 11464 Even Parity 01矩阵——枚举
- uva 11520 Fill the Square(枚举)
- uva 10245 The Closest Pair Problem_枚举
- uva 12587 二分枚举
- uva 1508 Equipment(暴力+枚举子集)