shunfurh
编程介的小学生
2017-09-27 14:25

Problem about GCD

  • gcd
  • it
  • less
  • each

Problem Description
Given integer m. Find multiplication of all 1<=a<=m such gcd(a, m)=1 (coprime with m) modulo m.

Input
Input contains multiple tests, one test per line.
Last line contains -1, it should be skipped.

[Technical Specification]
m <= 10^18

Output
For each test please output result. One case per line. Less than 160 test cases.

Sample Input
1
2
3
4
5
-1

Sample Output
0
1
2
3
4

  • 点赞
  • 回答
  • 收藏
  • 复制链接分享

1条回答

为你推荐

换一换