UVA - 11636 Hello World! (贪心)
2017-08-12 17:39
459 查看
思路:复制次数最少并且可以部分复制,那么贪心地让当前尽量多的复制,如果最后一次复制会超过n,那就部分复制。即满足(1<<x)≥n并且x尽量小。
AC代码
如有不当之处欢迎指出!
AC代码
#include <stdio.h> const int maxn = 20; int bit[maxn]; void init() { bit[0] = 1; for(int i = 1; i < maxn; i++) { bit[i] = bit[i-1] * 2; } } int main() { init(); int n, kase = 1; while (scanf("%d", &n) == 1 && n > 0) { int ans; for(ans = 0; ans < maxn; ans++) { if(bit[ans] >= n) { break; } } printf("Case %d: %d\n", kase++, ans); } return 0; }
如有不当之处欢迎指出!
相关文章推荐
- 贪心水题。UVA 11636 Hello World,LA 3602 DNA Consensus String,UVA 10970 Big Chocolate,UVA 10340 All in All,UVA 11039 Building Designing
- UVA - 11636 Hello World! 贪心水题
- UVa11636 - Hello World!(贪心)
- uva 11636 - Hello World!(规律)
- UVa 11636 Hello World! (水题思维)
- UVA 11636 - Hello World!
- Uva-11636-Hello World!
- UVa 11636 - Hello World!
- UVa 11636 - Hello World!
- UVA 11636 Hello World!——水题
- UVA-11636-Hello World!
- uva 11636 - Hello World!(规律)
- UVA 11636 Hello World!
- UVA 11636 Hello World!
- UVA 11636 Hello World!
- ecjtu-summer training #5 A - Hello World! UVA - 11636
- UVA 11636 (贪心)
- UVA11636-Hello World!-水题
- uva - 11636 - Hello World!(简单数学)
- UVA11636 - Hello World!