有這麽道題目：在自動販賣機裏賣巧克力派，1塊錢一個，每個巧克力派裏面都有一張優惠卷，湊夠7個優惠卷換一個巧克力派，問N塊錢，可以買+換多少巧克力派，並剩下幾張優惠卷。
例如：
輸入：20
輸出：巧克力：23 優惠卷：2
程序代碼如下： (閱讀全文…)
羽毛最近雖然沒怎麽樣子玩游戯
但是人卻是越來越忙
然後就是以前的老師很突然的過來叫我去訓練
去參加今年四月份的ACM競賽
可能大家從我的前面兩篇日志就看出來了
但是過了一年之後感覺興趣平平
或者根本的說就是很無力 (閱讀全文…)
其實算是簡單題吧
用組數模擬下就出來了- –
哈。
The Drunk Jailer
Time Limit: 1 Second Memory Limit: 32768 KB
A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.
One night, the jailer gets bored and decides to play a game. For round 1 of the game, he takes a drink of whiskey, and then runs down the hall unlocking each cell. For round 2, he takes a drink of whiskey, and then runs down the hall locking every other cell (cells 2, 4, 6, …). For round 3, he takes a drink of whiskey, and then runs down the hall. He visits every third cell (cells 3, 6, 9, …). If the cell is locked, he unlocks it; if it is unlocked, he locks it. He repeats this for n rounds, takes a final drink, and passes out.
(閱讀全文…)
很久之前就想了
既然C語言感覺深入不能
那麽何不去探究下C++呢？
然後就去買了兩本書
C++ Primer和C++ Primer 練習冊
今天兩本書一起到了 看起來分量很足
很好很強大 無聊的上課時間終于可以打發了（死。
Time Limit: 1 Second Memory Limit: 32768 KB
In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Beijing Olympics is to be a festival for people all over the world as well.
The motto of Olympic Games is “Citius, Altius, Fortius”, which means “Faster, Higher, Stronger”.
In this problem, there are some records in the Olympic Games. Your task is to find out which one is faster, which one is higher and which one is stronger.
Input