06 2015 档案

ACM学习历程—Hihocoder 1178 计数(位运算 && set容器)(hihoCoder挑战赛12)
摘要:时间限制:10000ms单点时限:1000ms内存限制:256MB描述Rowdark是一个邪恶的魔法师。在他阅读大巫术师Lich的传记时,他发现一类黑魔法来召唤远古生物,鱼丸。魔法n能召唤类型i鱼丸当且仅当i能够被表示为x xor n*x对于某个正整数x和固定的n。Rowdark想知道类型为[L,R... 阅读全文

posted @ 2015-06-14 22:18 AndyQsmart 阅读(237) 评论(0) 推荐(0)

ACM学习历程—Hihocoder 1177 顺子(模拟 && 排序 && gcd)(hihoCoder挑战赛12)
摘要:时间限制:6000ms单点时限:1000ms内存限制:256MB描述你在赌场里玩梭哈,已经被发了4张牌,现在你想要知道发下一张牌后你得到顺子的概率是多少?假定赌场使用的是一副牌,四种花色的A、2、3、...、J、Q、K共52张,这副牌只发给你了4张,你的剩下一张牌从剩下48张中任意取出一张。顺子指的... 阅读全文

posted @ 2015-06-14 21:45 AndyQsmart 阅读(301) 评论(0) 推荐(0)

ACM学习历程—HDU5269 ZYB loves Xor I(位运算 && dfs && 排序)(BestCoder Round #44 1002题)
摘要:Problem DescriptionMemphis loves xor very musch.Now he gets an array A.The length of A is n.Now he wants to know the sum of all (lowbit(Ai xor Aj) (i,... 阅读全文

posted @ 2015-06-13 21:40 AndyQsmart 阅读(400) 评论(0) 推荐(1)

ACM学习历程—SNNUOJ 1116 A Simple Problem(递推 && 逆元 && 组合数学 && 快速幂)(2015陕西省大学生程序设计竞赛K题)
摘要:DescriptionAssuming a finite – radius “ball” which is on an N dimension is cut with a “knife” of N-1 dimension. How many pieces will the “ball” be cut... 阅读全文

posted @ 2015-06-12 12:00 AndyQsmart 阅读(288) 评论(1) 推荐(0)

ACM学习历程—HDU5265 pog loves szh II(策略 && 贪心 && 排序)
摘要:DescriptionPog and Szh are playing games.There is a sequence with $n$ numbers, Pog will choose a number A from the sequence. Szh will choose an anothe... 阅读全文

posted @ 2015-06-09 17:31 AndyQsmart 阅读(283) 评论(0) 推荐(0)

ACM学习历程—FZU 2144 Shooting Game(计算几何 && 贪心 && 排序)
摘要:DescriptionFat brother and Maze are playing a kind of special (hentai) game in the playground. (Maybe it’s the OOXX game which decrypted in the last p... 阅读全文

posted @ 2015-06-01 21:41 AndyQsmart 阅读(294) 评论(0) 推荐(0)

导航