UVA 11205 - The broken pedometer
2014-08-16 16:36
405 查看
题目大意:给你 n 个 LED 组成的相同的显示器 m 个,每个显示器上显示一个符号
问最少使用 n 位中的几个位,就能区分这 m 个不同符号,均不相同即可
解题思路:枚举所有可能的方案,记录下最小的那个
问最少使用 n 位中的几个位,就能区分这 m 个不同符号,均不相同即可
解题思路:枚举所有可能的方案,记录下最小的那个
#include <cstdio> #include <cstring> int main() { int t, vis[1<<15]; scanf("%d", &t); while (t--) { int LED[105] = {0}, n, m, num, ans = 20; scanf("%d%d", &n, &m); for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) { scanf("%d", &num); LED[i] = (LED[i] << 1) + num; } for (int i = 0; i < (1 << n); i++) { bool real = true; memset(vis, 0, sizeof(vis)); for (int j = 0; j < m; j++) vis[LED[j] & i] ? real = false, j = m : vis[LED[j] & i] = 1; if (real) { int sum = 0; for (int j = 0; j < 15; j++) sum += ((i>>j) & 1); if (sum < ans) ans = sum; } } printf("%d\n", ans); } return 0; }
相关文章推荐
- UVA 11205 The broken pedometer
- UVa 11205 - The broken pedometer
- uva 11205 The broken pedometer
- uva 11205 The Broken Pedometer
- uva 11205 - The broken pedometer
- UVa 11205 The broken pedometer (枚举好题&巧用二进制)
- UVA - 11205 The broken pedometer
- UVA - 11205 The broken pedometer(子集枚举+增量构造法)
- UVA 11205 The broken pedometer
- UVa-11205-The broken pedometer
- UVa-11205-The broken pedometer
- uva 11205 The broken pedometer(暴力枚举+子集生成)
- UVA 11205 The broken pedometer
- uva 11205 The broken pedometer
- UVA 11205 The broken pedometer
- uva 11205 The broken pedometer
- UVA 11205 The broken pedometer
- uva 11205 - The broken pedometer
- UVa 11205 - The broken pedometer
- uva 11205 The broken pedometer