CF1514C.Product 1 Modulo N

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Now you get Baby Ehab's first words: "Given an integer $n$ , find the longest subsequence of $[1,2, \ldots, n-1]$ whose product is $1$ modulo $n$ ." Please solve the problem.

A sequence $b$ is a subsequence of an array $a$ if $b$ can be obtained from $a$ by deleting some (possibly all) elements. The product of an empty subsequence is equal to $1$ .

输入格式

The only line contains the integer $n$ ( $2 \le n \le 10^5$ ).

输出格式

The first line should contain a single integer, the length of the longest subsequence.

The second line should contain the elements of the subsequence, in increasing order.

If there are multiple solutions, you can print any.

输入输出样例

输入#1
```
5
```
输出#1
```
3
1 2 3
```
输入#2
```
8
```
输出#2
```
4
1 3 5 7
```

说明/提示

In the first example, the product of the elements is $6$ which is congruent to $1$ modulo $5$ . The only longer subsequence is $[1,2,3,4]$ . Its product is $24$ which is congruent to $4$ modulo $5$ . Hence, the answer is $[1,2,3]$ .

首页