摘要: Time Limit: 2 Seconds Memory Limit: 65536 KB Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimu... 阅读全文
posted @ 2012-03-30 16:44 Gavin Lipeng Ma 阅读(485) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 2 Seconds Memory Limit: 65536 KB An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before cl... 阅读全文
posted @ 2012-03-30 16:01 Gavin Lipeng Ma 阅读(351) 评论(0) 推荐(0) 编辑