UVa 11384 - Help is needed for Dexter
2013-04-09 18:32
357 查看
将[1, n]从中间分成[1, n/2] 和[n/2+1, n]两个部分,分别包含n/2和(n+1)/2个数,将第二部分的数分别减去n/2+1, 第二部分变为[0, (n-1)/2], 第一部分包括第二部分,可得递推公式为:f(n) = f(n/2) + 1; 代码如下:
View Code
View Code
#include <cstdio> int f(int n) { return n == 1 ? 1 : f(n/2)+1; } int main() { int n; while(scanf("%d", &n) != EOF) printf("%d\n", f(n)); return 0; }
相关文章推荐
- UVa 11384 Help is needed for Dexter
- UVa11384 - Help is needed for Dexter
- Uva 11384 - Help is needed for Dexter
- UVa_11384_Help is needed for Dexter_贪心、二分最优的证明
- UVA 11384 - Help is needed for Dexter
- UVa 11384 Help is needed for Dexter
- D - Help is needed for Dexter UVA - 11384 (规律题)
- UVA 11384 - Help is needed for Dexter
- UVA11384—Help is needed for Dexter
- uva-----(11384)Help is needed for Dexter
- uva 11384 Help is needed for Dexter(模拟)
- uva - 11384 - Help is needed for Dexter(数学)
- uva 11384 - Help is needed for Dexter
- UVA 11384 Help is needed for Dexter
- UVA 11384 - Help is needed for Dexter
- UVA - 11384 Help is needed for Dexter
- uva 11384 正整数序列( Help is needed for Dexter)
- 【巧妙算法系列】【UVA 11384】 Help is needed for Dexter 正整数序列
- uva 11384 - Help is needed for Dexter
- UVA - 11384 Help is needed for Dexter ——递归