- 博客(5)
- 收藏
- 关注
RSS订阅原创 ACM-ICPC 2018 徐州赛区网络预赛 D. Easy Math(递归式+杜教筛)
Given a positive integers nnn , Mobius functionμ(n)μ(n)\mu(n) is defined as follows:μ(n)=⎧⎩⎨1(−1)k0n=1n=p1p2⋯pkotherμ(n)={1n=1(−1)kn=p1p2⋯pk0other \mu(n) = \begin{cases} 1 &n = 1 \\ (-1)^k & n = p_1...
2018-09-10 15:13:38
773
3
原创 NEFU 1507 Fibonacci And Gcd(莫比乌斯反演)
Fibonacci And Gcd Problem:1507 Time Limit:1000ms Memory Limit:65535K Description 给定n和m求解上述式子 Input 第一行一个T，代表有T组数据，1<=T<=10 接下来T行每行两个数字n和m，1<=n,m<=1e6 Output 输出答案，每行代表一个答案 Samp...
2018-09-10 14:17:55
276
原创 ACM-ICPC 2018 沈阳赛区网络预赛 E. The cake is a lie(单位圆覆盖问题+二分)
You promised your girlfriend a rounded cake with at least SSS strawberries.But something goes wrong, you don’t have the final cake but an infinite plane with NNN strawberries on it. And you need to ...
2018-09-08 20:02:28
824
原创 ACM-ICPC 2018 沈阳赛区网络预赛 G.Spare Tire (容斥)
A sequence of integer{an}{an}\left \{ a_{n} \right \}can be expressed as: an=⎧⎩⎨⎪⎪⎪⎪023an−1−an−22+n+1n=0n=1n>1an={0n=02n=13an−1−an−22+n+1n>1a_{n}=\left\{\begin{matrix} 0&n=0 \\ 2&n=1 \\ \...
2018-09-08 18:16:47
952
原创 斐波那契数列的前N项和
我们知道斐波那契数列为 ⎧⎩⎨⎪⎪F1=1F2=1Fn=Fn−1+Fn−2n>2{F1=1F2=1Fn=Fn−1+Fn−2n>2\left\{\begin{matrix}F_1=1\\ F_2=1\\ F_n=F_{n-1}+F_{n-2} &&n>2\end{matrix}\right. 那么如何求解他的前N项和呢 我们可以通过他的通项入手，斐波那契数列的通项为 Fn...
2018-09-03 14:58:45
29555
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人