Welcome to Yumao′s Blog.
關於最近的一些抱怨
, 2011年03月21日 , , 评论 在〈關於最近的一些抱怨〉中留言功能已關閉 ,

羽毛最近雖然沒怎麽樣子玩游戯
但是人卻是越來越忙
然後就是以前的老師很突然的過來叫我去訓練
去參加今年四月份的ACM競賽
可能大家從我的前面兩篇日志就看出來了
但是過了一年之後感覺興趣平平
或者根本的說就是很無力 (閱讀全文…)

关键字:, , ,
ZOJ Problem Set – 2417 Lowest Bit
, 2011年03月21日 , C Language , 评论 在〈ZOJ Problem Set – 2417 Lowest Bit〉中留言功能已關閉 ,

也是一道AC比較高的
感覺最近只對簡單題有feel?
盯著難題看了很久我只是想到了夜宵。。

Lowest Bit
Time Limit: 1 Second Memory Limit: 32768 KB

Given an positive integer A (1 <= A <= 100), output the lowest bit of A. For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2. Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8. (閱讀全文…)

ZOJ Problem Set – 1350 The Drunk Jailer
, 2011年03月21日 , C Language , 评论 在〈ZOJ Problem Set – 1350 The Drunk Jailer〉中留言功能已關閉 ,

其實算是簡單題吧
用組數模擬下就出來了- –
哈。

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.
(閱讀全文…)

关键字:, , , ,
分页 (1): 1