Coprimes
Practice
3.8 (41 votes)
Ad Hoc
Algorithms
Coprime
Easy
Greedy algorithms
Problem
71% Success 8359 Attempts 10 Points 1s Time Limit 256MB Memory 1024 KB Max Code

You are provided an integer \(n\). Your task is to determine the largest integer \(a\) (\(a<n-1\)) that is a coprime of \(n\). This implies that \(gcd(a,n)=1\).

Input format

A single line that contains an integer \(n\)

Output format

Print the answer to the question.

Constraints

\(3 \leq n \leq 10^{3}\)

Please login to use the editor

You need to be logged in to access the code editor

Loading...

Please wait while we load the editor

Loading...
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
1.( Problem A ) Pikachu and the Game of Strings
Points:10
60 votes
Tags:
AlgorithmsEasyGreedy Algorithms
2.Equalize strings
Points:10
9 votes
Tags:
Greedy AlgorithmsAlgorithmsStringBasics of Greedy Algorithms
3.Unique sorting
Points:10
6 votes
Tags:
AlgorithmsGreedy Algorithms