UVA 11384 Help is needed for Dexter (找规律)
2013-08-09 13:38
176 查看
题意:给一个正整数序列1,2,3....,n。每次操作可以从序列中选取任意多个数字同时减去一个相同的正整数,问至少多少次操作可以把所有数字变成0.
思路:首先,例如,1,2,3,0,1,2我们可以等价成1,2,3,。经过自己操作可以发现,第一次时把[n/2+1n,]减去n/2+1最好,这时会得到序列1,2,3.....n/2,0,1,2,...(n-1)/2.,它等价于1,2,3...n/2. 因此我们得到:f(n)=f(n/2)+1; f(1)=1。
思路:首先,例如,1,2,3,0,1,2我们可以等价成1,2,3,。经过自己操作可以发现,第一次时把[n/2+1n,]减去n/2+1最好,这时会得到序列1,2,3.....n/2,0,1,2,...(n-1)/2.,它等价于1,2,3...n/2. 因此我们得到:f(n)=f(n/2)+1; f(1)=1。
#include<cstdio> int main() { int n; while(~scanf("%d",&n)) { int ans=0; while(n) n/=2,++ans; printf("%d\n",ans); } return 0; }
相关文章推荐
- Help is needed for Dexter UVA - 11384(分治 找规律)
- D - 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
- UVA 11384(p25)----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
- 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_贪心、二分最优的证明
- UVa 11384 Help is needed for Dexter (数学)
- UVA Help is needed for Dexter 11384 (递归)