#716 div2 C题简单数论 gcd +思维

最新推荐文章于 2021-12-21 13:16:02 发布

__Rain

最新推荐文章于 2021-12-21 13:16:02 发布

阅读量133

点赞数

分类专栏：数论思维题

本文链接：https://blog.csdn.net/cosx_/article/details/118496494

版权

思维题同时被 2 个专栏收录

89 篇文章 1 订阅

订阅专栏

数论

17 篇文章 0 订阅

订阅专栏

C. Product 1 Modulo N
在这里插入图片描述
1 <= C <= n - 1
B % n = C
—> A * C % n = C
—> A % n * C % n = C
—> 1 * C = C
—> A % n = 1

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 9;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
int t = 1, n, m, k;
vector <int> ans;
int main()
{
	/*cin >> t;
	while(t--)
	{
		
	}*/
	scanf("%lld", &n);
	ll sum = 1;
	for(int i = 1; i < n; ++i)
	{
		if(__gcd(n, i) == 1){
			ans.push_back(i);
			sum = (sum * i) % n;	
		}
	}	
	if(sum == 1)
	{
		printf("%d\n", ans.size());
		for(auto &x : ans) printf("%d ",x);cout << '\n';
	}
	else 
	{
		printf("%d\n", ans.size() - 1);
		for(auto &x : ans) 
			if(x != sum) printf("%d ", x); cout << '\n';
	}
	return 0;
}