![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
逆元
Chen丶HC
这个作者很懒,什么都没留下…
展开
-
Problem: fireworks
Hmz likes to play fireworks, especially when they are put regularly. Now he puts some fireworks in a line. This time he put a trigger on each firework. With that trigger, each firework will explode and split into two parts per second, which means if a fire原创 2017-06-03 13:32:30 · 191 阅读 · 0 评论 -
HDUOJ 2138 How many prime numbers
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(fal原创 2017-07-10 21:31:09 · 391 阅读 · 0 评论 -
HDUOJ 2136 Largest prime factor
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define CLOSE() ios::sync_with_stdio(fal原创 2017-07-11 14:02:13 · 209 阅读 · 0 评论 -
HDUOJ 1160 Leftmost Digit
求整数部分,联想到科学计数法 设n^n = a*10^x,a的整数部分即为n的整数部分,也就是我们所求的 两边取对数,nlgn = x + lga; 求得a = 10^(nlgn-x),又应为0<a<10,得到lga即为nlg的小数部分 于是a = 10^(nlgn-floor(nlgn))取整 #include #include #include #include #include原创 2017-07-13 20:51:25 · 255 阅读 · 0 评论