2014年7月31日
【CodeChef】Small factorials（BigInteger笔记）
摘要： You are asked to calculate factorials of some small positive integers.InputAn integer t, 1 0){20 int num = Integer.parseInt(bf.readLine())... 阅读全文
posted @ 2014-07-31 17:38 SunshineAtNoon 阅读(266) 评论(0) 推荐(0)
【CodeChef】Factorial（n!末尾0的个数）
摘要： The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave t... 阅读全文
posted @ 2014-07-31 17:06 SunshineAtNoon 阅读(226) 评论(0) 推荐(0)
【CodeChef】Enormous Input Test
摘要： The purpose of this problem is to verify whether the method you are using to read input data is sufficiently fast to handle problems branded with the ... 阅读全文
posted @ 2014-07-31 16:31 SunshineAtNoon 阅读(276) 评论(0) 推荐(0)