A14208 | Product 1 Modulo N
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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$ .
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.
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]$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted