CHUPCCA

解題報告

0%

發表於 更新於 分類於 Disqus：

Codeforces 911B - Two Cakes

Two Cakes

It’s New Year’s Eve soon, so Ivan decided it’s high time he started setting the table. Ivan has bought two cakes and cut them into pieces: the first cake has been cut into a pieces, and the second one — into b pieces.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 34B - Sale

Sale

Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he’s very strong, Bob can carry at most m TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 230A - Dragons

Dragons

Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he’s got to defeat all n dragons that live on this level. Kirito and the dragons have strength, which is represented by an integer. In the duel between two opponents the duel’s outcome is determined by their strength. Initially, Kirito’s strength equals s.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 899B - Months and Years

Months and Years

Everybody in Russia uses Gregorian calendar. In this calendar there are 31 days in January, 28 or 29 days in February (depending on whether the year is leap or not), 31 days in March, 30 days in April, 31 days in May, 30 in June, 31 in July, 31 in August, 30 in September, 31 in October, 30 in November, 31 in December.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 976B - Lara Croft and the New Game

Lara Croft and the New Game

You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 38A - Army

Army

The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 1077A - Frog Jumping

Frog Jumping

A frog is currently at the point 0 on a coordinate axis Ox. It jumps by the following algorithm: the first jump is a units to the right, the second jump is b units to the left, the third jump is a units to the right, the fourth jump is b units to the left, and so on.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 344A - Magnets

Magnets

Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn’t need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a “plus”) and negative (a “minus”). If two magnets are put together at a close distance, then the like poles will repel each other and the opposite poles will attract each other.

閱讀全文 »

發表於 更新於 分類於 Disqus：

Codeforces 302B - Eugeny and Play List

Eugeny and Play List

Eugeny loves listening to music. He has n songs in his play list. We know that song number i has the duration of ti minutes. Eugeny listens to each song, perhaps more than once. He listens to song number i ci times. Eugeny’s play list is organized as follows: first song number 1 plays c1 times, then song number 2 plays c2 times, …, in the end the song number n plays cn times.

閱讀全文 »