![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
南工的神坑
快乐的奔跑在追梦的路上
展开
-
FZU 1062 洗牌问题
Problem Description设2n张牌分别标记为1, 2, ..., n, n+1, ..., 2n,初始时这2n张牌按其标号从小到大排列。经一次洗牌后,原来的排列顺序变成n+1, 1, n+2, 2, ..., 2n, n。即前n张牌被放到偶数位置2, 4, ..., 2n,而后n张牌被放到奇数位置1, 3, ..., 2n-1。可以证明对于任何一个自然数n,经过若干次洗牌后可原创 2016-04-01 17:50:39 · 425 阅读 · 0 评论 -
HDU 1009 FatMouse' Trade
FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 61967 Accepted Submission(s): 20887Problem DescriptionFatMouse prepared M原创 2016-03-24 17:22:37 · 205 阅读 · 0 评论