Difference between revisions of "Moscow Pre-Finals Workshop 2016. National Taiwan U Selection"
Jump to navigation
Jump to search
Line 10: | Line 10: | ||
Solved by zerol. 00:34 (+) | Solved by zerol. 00:34 (+) | ||
+ | |||
+ | 题意:求 $F_{F_n}$ 模一个数,其中 $F$ 是斐波那契数列。 | ||
+ | |||
+ | 题解:利用板子里的皮萨诺周期的公式,然后套个快速幂就好了。(由于模数只有一个,所以即便是你不会这个公式,本地也能方便的求出它的周期,所以这是签到题。) | ||
== Problem H == | == Problem H == |
Revision as of 04:20, 28 March 2019
Problem A
Solved by ultmaster. 00:58 (+)
Problem B
Solved by zerol. 03:46 (+)
Problem F
Solved by zerol. 00:34 (+)
题意:求 $F_{F_n}$ 模一个数,其中 $F$ 是斐波那契数列。
题解:利用板子里的皮萨诺周期的公式,然后套个快速幂就好了。(由于模数只有一个,所以即便是你不会这个公式,本地也能方便的求出它的周期,所以这是签到题。)
Problem H
Unsolved. (-10)
Problem I
Solved by zerol. 02:07 (+)
Problem J
Solved by kblack. 01:33 (+5)
题意:$C_k = MAX_{i+j \equiv k \pmod{n}}{a_i+b_j}$
题解:两边各找最大的 3000,互相搞一搞,好了?