2017年8月1日
Tempter of the Bone
摘要： The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could f 阅读全文
posted @ 2017-08-01 19:50 ⊙∽⊙Perseverance 阅读(117) 评论(0) 推荐(0) 编辑
HPU--1141 蜗牛爬树
摘要： 1141: 蜗牛爬树 [模拟] 题目描述 阿门阿前一棵葡萄树，阿嫩阿嫩绿地刚发芽，蜗牛背著那重重的壳呀，一步一步地往上爬。 想必很多小伙伴都听过这首《蜗牛与黄鹂鸟》，那么现在知道了蜗牛所爬树的高度。蜗牛白天爬一段距离，但是晚上将会下落一段距离。 求蜗牛爬到树顶是在第几天。 阿门阿前一棵葡萄树，阿嫩阿 阅读全文
posted @ 2017-08-01 15:55 ⊙∽⊙Perseverance 阅读(319) 评论(0) 推荐(0) 编辑
2017年7月31日
Red and Black
摘要： There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he c 阅读全文
posted @ 2017-07-31 18:15 ⊙∽⊙Perseverance 阅读(163) 评论(0) 推荐(0) 编辑
Fox And Two Dots
摘要： Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of size n × m cells, like this: Each cell contains 阅读全文
posted @ 2017-07-31 15:34 ⊙∽⊙Perseverance 阅读(158) 评论(0) 推荐(0) 编辑
Oil Deposits
摘要： The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of 阅读全文
posted @ 2017-07-31 14:47 ⊙∽⊙Perseverance 阅读(115) 评论(0) 推荐(0) 编辑
2017年7月30日
【转】Hdu--4135 Co-prime
摘要： Problem Description Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N.Two inte 阅读全文
posted @ 2017-07-30 20:55 ⊙∽⊙Perseverance 阅读(110) 评论(0) 推荐(0) 编辑
【模板】容斥原理
摘要： 1 #include 2 int num[6] = {2,3,5,7}; 3 int n; 4 int solve() 5 { 6 int ans = 0; //是那四个数的倍数的数的数量 7 for (int i = 1 ; i < (1<<4) ; i++) //选数 8 { 9 int ant = 0... 阅读全文
posted @ 2017-07-30 18:03 ⊙∽⊙Perseverance 阅读(177) 评论(0) 推荐(0) 编辑
【模板】欧拉函数
摘要： 也就是求小于或等于n的互质数的个数 阅读全文
posted @ 2017-07-30 18:00 ⊙∽⊙Perseverance 阅读(105) 评论(0) 推荐(0) 编辑
POJ--2356 Find a multiple
摘要： Description The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers 阅读全文
posted @ 2017-07-30 17:30 ⊙∽⊙Perseverance 阅读(132) 评论(0) 推荐(0) 编辑
2017年7月29日
Trailing Zeroes (III)
摘要： You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For e 阅读全文
posted @ 2017-07-29 11:19 ⊙∽⊙Perseverance 阅读(232) 评论(0) 推荐(0) 编辑