UVA10940 - Throwing cards away II(找规律)
2014-11-18 21:19
387 查看
UVA10940 - Throwing cards away II(找规律)
题目链接
题目大意:桌上有n张牌,按照1-n的顺序从上到下,每次进行将第一张牌丢掉,然后把第二张放到这叠牌的最后。反复进行这样的操作,直到只剩下一张牌。
解题思路:只能先暴力,将前面小点的n打印出来,看看有什么规律。
规律:f【2^k + mod] = 2*mod;(mod > 0); n = 1需要特判.
代码:
题目链接
题目大意:桌上有n张牌,按照1-n的顺序从上到下,每次进行将第一张牌丢掉,然后把第二张放到这叠牌的最后。反复进行这样的操作,直到只剩下一张牌。
解题思路:只能先暴力,将前面小点的n打印出来,看看有什么规律。
规律:f【2^k + mod] = 2*mod;(mod > 0); n = 1需要特判.
代码:
#include <cstdio> #include <cstring> const int maxn = 5e5 + 5; int f[maxn]; void init () { int tmp = 1; f[1] = 1; for (int i = 2; i <= maxn - 5; i++) { if(i > tmp * 2) { tmp *= 2; f[i] = 2 * (i - tmp); } else f[i] = 2 * (i - tmp); } } int main () { init(); int n; while (scanf ("%d", &n) && n) { printf ("%d\n", f ); } 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 10940 Throwing cards away II
- uva 10940 - Throwing cards away II
- UVA10940 - Throwing cards away II(找到规律)
- UVa 10935 Throwing cards away I【队列】
- Throwing cards away I UVA - 10935
- UVa 10935 - Throwing cards away I
- UVa 10935 - Throwing cards away I(模拟)
- UVA - 10935 Throwing cards away I
- queue模拟(Uva Throwing cards away I)
- UVA 10935 - Throwing cards away I
- UVa 10935 Throwing cards away I【队列模拟】
- UVa 10935 Throwing cards away I(习题5-3)
- Uva 10935 Throwing cards away I