UVa 11384 Help is needed for Dexter / 二分
2013-10-26 23:45
344 查看
这题和zoj的豆子那题差不多 每次对半分就行了
#include <stdio.h> int dfs(int n) { if(n == 1) return 1; return dfs(n/2) + 1; } int main() { int n; while(scanf("%d",&n)!=EOF) { printf("%d\n",dfs(n)); } return 0; }
相关文章推荐
- 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
- 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
- UVa11384 - Help is needed for Dexter
- 正整数序列 (Help is needed for Dexter, UVa 11384)
- UVA 11384 Help is needed for Dexter
- uva-11384-Help is needed for Dexter
- UVA - 11384 Help is needed for Dexter