Warning: session_start(): open(/tmp/sess_63ba5ef3284d5d4a0ba532da6a4da914, 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
Writing /data/wiki/data/cache/d/de2edb2fcb553ea79b79c722a4e13dbc.captchaip failed
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
=====E=====
* 题意:$t$ 组询问，每次询问一个 $n$ ，问将所有 $n$ 的因数组成一个环，使得环上相邻的数互质的个数最少，输出方案与最小个数。
* 题解:显然 $n = p^k$ 时随便构造即可。$n = p_1p_2$ 时必然会有一个互质对，随便构造即可。$n = p_1^i p_2^j$ 时易构造出互质对为零的情况。$n$ 的质因数大于三时，先构造出一个简单环 $p_1,p_1p_2,p_2,\cdots,p_k,p_kp_1$，将所有除了环上的因数按照因数的最小质因数进行分类，连在最小质因数后即可。
=====F=====
* 题意:
* 题解: