Difference between revisions of "CCPC-Final 2018"
Jump to navigation
Jump to search
(Created page with "== Replay == ultmaster: * 两小时就结束了。 == Problem A == Solved by zerol. 00:14 (+) == Problem B == Solved by kblack. 01:31 (+) == Problem D == Unsolved. (-3...") |
|||
| Line 34: | Line 34: | ||
Solved by kblack. 00:29 (+1) | Solved by kblack. 00:29 (+1) | ||
| + | |||
| + | 题意：破解 RSA，离散数学期中考试题。 | ||
| + | |||
| + | 题解：暴力破出 $n=pq$，求个幂，指数是 $2^{30}+3$ 对 $\phi(n) = (p-1)(q-1)$ 的逆元。 | ||
== Problem L == | == Problem L == | ||
Solved by ultmaster. 00:55 (+) | Solved by ultmaster. 00:55 (+) | ||
Revision as of 15:22, 25 November 2018
Replay
ultmaster:
- 两小时就结束了。
Problem A
Solved by zerol. 00:14 (+)
Problem B
Solved by kblack. 01:31 (+)
Problem D
Unsolved. (-3)
ultmaster: 代码相当宏伟。
Problem G
Solved by ultmaster. 00:29 (+1)
Problem H
博弈真好玩。
Problem I
Solved by zerol. 01:51 (+)
Problem K
Solved by kblack. 00:29 (+1)
题意：破解 RSA，离散数学期中考试题。
题解：暴力破出 $n=pq$，求个幂，指数是 $2^{30}+3$ 对 $\phi(n) = (p-1)(q-1)$ 的逆元。
Problem L
Solved by ultmaster. 00:55 (+)