UVa 10940 - Throwing cards away II(数论,规律)
来源:互联网 发布:gulp js语法检查 编辑:程序博客网 时间:2024/04/29 03:40
这个题可以按逆序思路来想
最后剩下的牌,除了1张之外,最后一张剩下的一定是偶数牌
然后,2^n张牌剩下的一定是2^n
2^n-1张牌剩下的一定是2^n-2
...
以此,可推得以下数列:
ans(1)=1;
ans(2)=2;
ans(3...4)={2,4};
ans(5...8)={2,4,6,8};
...
ans(2^(n-1)+1...2^n)={2,...,2^n}
#include <stdio.h>int main(){ int p[500010]; int s=3,n; p[1]=1; p[2]=2; int k=1; while(1) { if(s>500000)break; for(int j=1; j<=(1<<k); j++) { if(s>500000)break; p[s++]=j*2; } k++; } while(scanf("%d",&n)&&n) { printf("%d\n",p[n]); } return 0;}
- UVa 10940 - Throwing cards away II(数论,规律)
- UVA 10940 - Throwing cards away II(规律)
- uva 10940 Throwing cards away II
- uva 10940 - Throwing cards away II
- UVA 10940 Throwing cards away II
- UVa:10940 Throwing cards away II
- UVa 10940 - Throwing cards away II
- uva 10940Throwing cards away II
- UVA10940 - Throwing cards away II(找规律)
- UVa 10940 Throwing cards away II (约瑟夫问题)
- Throwing cards away II
- uva:Throwing cards away I
- UVA 10935 Throwing cards away
- Throwing cards away I UVA
- UVA-Throwing cards away I
- Throwing cards away I UVA
- UVa 10935 - Throwing cards away I(模拟)
- queue模拟(Uva Throwing cards away I)
- 光盘安装ubuntu12.10 添加引导项
- sql查处某字段不重复的全部记录
- 牛人简历
- 项目的质量控制与质量保证的区别与联系
- codeforces~~~
- UVa 10940 - Throwing cards away II(数论,规律)
- 再议C语言第二节(数组与指针)讲座整理
- 质量保证与质量控制的区别
- 如何进行软件架构设计?
- 你可能不知道的Visual Studio 2010使用技巧(VS2010的秘密)
- 再议C语言(编译与链接)讲座整理
- open DOVE
- 解决tomcat服务器端口占用的方法
- #ifndef 与 #program once 的区别