Warning: session_start(): open(/tmp/sess_ee65fd57760d317caa1c4ce4115656b4, O_RDWR) failed: No space left on device (28) in /data/wiki/inc/init.php on line 239
Warning: session_start(): Failed to read session data: files (path: ) in /data/wiki/inc/init.php on line 239
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/auth.php on line 430
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 40
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 41
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 42
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/feed.php on line 43
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/httputils.php on line 28
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/httputils.php on line 29 CVBB ACM Team 2020-2021:teams:hotpot:front_page
https://wiki.cvbbacm.com/
2026-06-16T16:26:21+0800CVBB ACM Team
https://wiki.cvbbacm.com/
https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.icotext/html2020-05-15T17:41:01+0800Anonymous (anonymous@undisclosed.example.com)2020-2021:teams:hotpot:front_page:codeforces641div2
https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:hotpot:front_page:codeforces641div2&rev=1589535661&do=diff
Codeforces Round #641 (Div. 2)
A.Orac and Factors
题目大意
对于一个数 $n ≤ 10^6$ ，找到它最小的不是1的约数，然后加在这个值上，重复 $k ≤ 10^9 $次
解题思路
首先对于偶数，这个数一定是 2，而对于奇数，一次操作之后就会变成偶数，答案是显然的。$ a_n (n \le 1e6) $$a_j > a_i $$ O( nlogn ) $$ s_n (n \le 100000) $$ t = \{ lcm({a_i,a_j})|i < j \} $$ gcd(t) $$ lcm,gcd $$ a_n (n \le 100000 ，1 \le a_i \le 1e9) $$k (1 \le k \le 1e9) $$ k $$ k $$ k $$ k $$ k $$ k $$ k $$ k $$\ge k$$k$$k$$k$$ n \times m 的 01 矩阵 (1 \le n,m \le 1000)$$ (0 \rightarrow 1, 1 \rightarrow 0) $$ t \le 100000…