数论
文章平均质量分 73
talak
这个作者很懒,什么都没留下…
展开
-
pills
2087 - Pills Accepted: 7 Submissions: 8 Time Limit: 1000 ms Memory Limit: 1048576 KB Aunt Lizzie takes half a pill of a certain medicine every day. She starts with a b原创 2012-08-12 23:09:05 · 634 阅读 · 0 评论 -
hdu 4135 co-prime
裸的容斥原理题 学习用 代码: #include #include #include #include #include #include #include #include #include using namespace std; int stacks[1005]; int len; long long a,b; long long numa=0; long long原创 2012-10-14 09:34:55 · 592 阅读 · 0 评论 -
codeforces Beautiful Numbers
枚举 sum = ai + b(n - i) C[n][i] = fact[n]inv(fact[n - i]fact[i]).inv(a) is multiplicative inverse element(moduloMOD). MOD is a prime number, soinv(a) = aMOD - 2. 乘法逆元解决 除法中模的方法 代码: #include原创 2013-05-14 01:00:40 · 646 阅读 · 0 评论