07 2013 档案
摘要：Problem C: The TripTime Limit: 1 SecMemory Limit: 64 MBSubmit: 19Solved: 3[Submit][Status][Web Board]DescriptionThe Trip A group of students are members of a club that travels annually to different locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia
阅读全文
摘要：Problem E: Graphical EditorTime Limit:1 SecMemory Limit:64 MBSubmit:2Solved:2[Submit][Status][Web Board]DescriptionGraphical editors such as Photoshop allow us to alter bit-mapped images in the same way that text editors allow us to modify documents. Images are represented as an M x N array of pixel
阅读全文
摘要：Problem D: LC-DisplayTime Limit:1 SecMemory Limit:64 MBSubmit:14Solved:3[Submit][Status][Web Board]DescriptionA friend of yours has just bought a new computer. Before this, the most powerful machine he ever used was a pocket calculator. He is a little disappointed because he liked the LCD display of
阅读全文
摘要：Problem B: MinesweeperTime Limit:1 SecMemory Limit:64 MBSubmit:29Solved:7[Submit][Status][Web Board]DescriptionMinesweeper Have you ever played Minesweeper? This cute little game comes with a certain operating system whose name we can't remember. The goal of the game is to find where all the min
阅读全文
摘要：Problem A: The 3n + 1 problemTime Limit:1 SecMemory Limit:64 MBSubmit:14Solved:6[Submit][Status][Web Board]DescriptionConsider the following algorithm to generate a sequence of numbers. Start with an integer n. If n is even, divide by 2. If n is odd, multiply by 3 and add 1. Repeat this process with
阅读全文
