随笔分类 -  ACM(ZOJ)

摘要：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.. 阅读全文

摘要：Beautiful MeadowTime Limit: 5 Seconds Memory Limit: 32768 KBTom's MeadowTom has a meadow in his garden. He divides it into N * M squares. Initially all the squares are covered with grass and there may be some squares cannot be mowed.(Let's call them forbidden squares.) He wants to mow down t 阅读全文

摘要：Tour in the CastleTime Limit: 5 Seconds Memory Limit: 32768 KBAfter the final BOSS is defeated, the hero found that the whole castle is collapsing (very familiar scene, isn't it). Escape from the castle is easy, just need to cross a few rooms. But as the Hero is full of adventurous spirit, he de 阅读全文

摘要：Gao the GridTime Limit: 2 Seconds Memory Limit: 65536 KBA n * m grid as follow:Count the number of triangles, three of whose vertice must be grid-points.Note that the three vertice of the triangle must not be in a line(the right picture is not a triangle). InputThe input consists of several cases... 阅读全文

摘要：Kitty's GameTime Limit: 2 Seconds Memory Limit: 65536 KBKitty is a little cat. She is crazy about a game recently.There are n scenes in the game(mark from 1 to n). Each scene has a number pi. Kitty's score will become least_common_multiple(x,pi) when Kitty enter the ith scene. x is the score 阅读全文

摘要：The Hive IITime Limit: 5 Seconds Memory Limit: 65536 KBThere is a hive in the village. Like this. There are 8 columns(from A to H) in this hive. Different colums have the same number of grids. Every grid has its own coordinate, which is formed by two uppercases, representing the row index and the c. 阅读全文

摘要：80ers' MemoryTime Limit: 1 Second Memory Limit: 32768 KBI guess most of us are so called 80ers, which means that we were born in the 1980's. This group of people shared a lot of common memories. For example, the Saint Seiya, the YoYo ball, the Super Mario, and so on. Do you still remember th 阅读全文

摘要：Connect themTime Limit: 1 Second Memory Limit: 32768 KBYou have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers j and i). The cost of connect. 阅读全文

摘要：ZOJ Problem Set - 3203Light BulbTime Limit: 1 Second Memory Limit: 32768 KBCompared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house, thinking of how to ea 阅读全文

摘要：Count the ColorsTime Limit: 2 Seconds Memory Limit: 65536 KBPainting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segments of different colors you can see at last.InputThe first line of each data set contains . 阅读全文

摘要：Leaps Tall BuildingsTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeIt's a bird! It's a plane! It's coming right at us!Although it sometimes seems like it, Superman can't fly (without a plane). Instead, he makes super-human leaps, especially over tall buildings. Since he ne 阅读全文

摘要：Points WithinTime Limit: 2 Seconds Memory Limit: 65536 KBStatement of the Problem Several drawing applications allow us to draw polygons and almost all of them allow us to fill them with some color. The task of filling a polygon reduces to knowing which points are inside it, so programmers have to . 阅读全文

摘要：Crashing BalloonTime Limit: 1 Second Memory Limit: 32768 KBOn every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. The rule is very simple. On the ground there are 100 labeled balloons, with the numbers 1 to 100. After the referee shouts "Let 阅读全文