persistent codeants

摘要： In the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the way his soldiers are aligned; it is true that the soldiers are aligned in order by their code number: 1 , 2 , 3 阅读全文

摘要： 1080. Map ColoringTime limit: 1.0 second Memory limit: 64 MBWe consider a geographical map withNcountries numbered from 1 toN(0 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include10 #include11 using namespace std;12 int pay[105];13 queueQ;14 int map[105][105];15 i 阅读全文

摘要： 1242. WerewolfTime limit: 1.0 second Memory limit: 64 MBKnife. Moonlit night. Rotten stump with a short black-handled knife in it. Those who know will understand. Disaster in the village. Werewolf.There are no so many residents in the village. Many of them are each other's relatives. Only this m 阅读全文

摘要： 1033. LabyrinthTime limit: 1.0 second Memory limit: 64 MBAdministration of the labyrinth has decided to start a new season with new wallpapers. For this purpose they need a program to calculate the square of the walls inside the labyrinth. This job is just for you!The labyrinth is represented by a m 阅读全文

摘要： 1280. Topological SortingTime limit: 1.0 second Memory limit: 64 MBMichael wants to win the world championship in programming and decided to studyNsubjects (for convenience we will number these subjects from 1 toN). Michael has worked out a study plan for this purpose. But it turned out that certain 阅读全文