Uva-11384-Help is needed for Dexter
2013-03-16 20:45
309 查看
题意大致为给你一个1,2,3,.....n的序列,每次你可以选择其中的一些数减去一个数,要求求出最少的操作次数,使得所有的数都变为0
这个题可以使用2分的方法,将数分为2部门,将后半部分减去中间的数,则使得后面部分与前面部分一致,然后再进行划分即可。
代码:
这个题可以使用2分的方法,将数分为2部门,将后半部分减去中间的数,则使得后面部分与前面部分一致,然后再进行划分即可。
代码:
#include<cstdio> #include<cstring> int main() { int n; while(scanf("%d",&n)!=EOF) { int ans=0; while(n) { n>>=1; ans++; } printf("%d\n",ans); } return 0; }
相关文章推荐
- Uva 11384 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
- UVA 11384 Help is needed for Dexter(问题转化 递归)
- Uva 11384 - 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(递归)
- help is needed for dexter uva 11384
- 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