摘要：A - Play the Dice时间限制:2000 MS内存限制:65535 MB问题描述There is a dice withN sides, which are numbered from 1,2,...,n and have the equal possibility to show up when one rolls a dice. Each side has an integer Aion it. Now here is a game that you can roll this dice once, if the i-th side is up, you will getAiy
阅读全文
摘要：Time travelTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 517Accepted Submission(s): 80Problem DescriptionAgent K is one of the greatest agents in a secret organization called Men in Black. Once he needs to finish a mission by traveling through ti
阅读全文
摘要：Card CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1405Accepted Submission(s): 624Special JudgeProblem DescriptionIn your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you colle
阅读全文
摘要：Help Me EscapeTime Limit: 2 Seconds Memory Limit: 32768 KBBackgroundIf thou doest well, shalt thou not be accepted? and if thou doest not well, sin lieth at the door. And unto thee shall be his desire, and thou shalt rule over him. And Cain talked with Abel his brother: and it came to pass, when th.
阅读全文
摘要：Patchouli's Spell CardsTime Limit: 7 Seconds Memory Limit: 65536 KBPatchouli Knowledge, the unmoving great library, is a magician who has settled down in the Scarlet Devil Mansion (紅魔館). Her specialty is elemental magic employing the seven elements fire, water, wood, metal, earth, sun, and moon.
阅读全文
摘要：495. Kids and PrizesTime limit per test: 0.5 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardICPC (International Cardboard Producing Company) is in the business of producing cardboard boxes. Recently the company organized a contest for kids for the best design of a cardboard bo
阅读全文
摘要：FootballTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1934Accepted: 958DescriptionConsider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index
阅读全文
摘要：D. Bag of micetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the pri
阅读全文
摘要：Check the difficulty of problemsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3191Accepted: 1416DescriptionOrganizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms: 1. A
阅读全文
摘要：LOOPSTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 649Accepted Submission(s): 267Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the
阅读全文
摘要：MazeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 957Accepted Submission(s): 307Special JudgeProblem DescriptionWhen wake up, lxhgww find himself in a huge maze.The maze consisted by N rooms and tunnels connecting these rooms. Each pair of rooms
阅读全文
摘要：ActivationTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 520Accepted Submission(s): 179Problem DescriptionAfter 4 years' waiting, the game "Chinese Paladin 5" finally comes out. Tomato is a crazy fan, and luckily he got the first r
阅读全文
摘要：Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 361Accepted Submission(s): 255Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws
阅读全文
摘要：One Person GameTime Limit: 1 Second Memory Limit: 32768 KB Special JudgeThere is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K1 faces. Die2 has K2 faces. Die3 has K3 faces. All the dice are fair dice, so the probability of rolling each value..
阅读全文
摘要：Collecting BugsTime Limit: 10000MSMemory Limit: 64000KTotal Submissions: 1244Accepted: 523Case Time Limit: 2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he
阅读全文
摘要：概率DP主要用于求解期望、概率等题目。转移方程有时候比较灵活。一般求概率是正推，求期望是逆推。通过题目可以体会到这点。首先先推荐几篇参考的论文：《信息学竞赛中概率问题求解初探》《浅析竞赛中一类数学期望问题的解决方法》 《有关概率和期望问题的研究 》1、POJ 3744 Scout YYF I此题是一个用矩阵优化的求概率的题目。主要思想是分段，根据转移方程用矩阵求解。题解见 herePOJ 3744/*POJ 3744C++ 0ms 184K*/#include<stdio.h>#include<string.h>#include<algorithm>#inc
阅读全文
摘要：Scout YYF ITime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3723Accepted: 928DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficulties, YYF is now at the start of enemy's famous "mine
阅读全文
