Coprimes
Practice
3.8 (41 votes)
Ad Hoc
Algorithms
Coprime
Easy
Greedy algorithms
Problem
71% Success 8361 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
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}\)
Explanation
Largest integer less than 3 (n-1), coprime with 4 is 1
Code Editor
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
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:10
86 votes
Tags:
AlgorithmsApprovedEasyGreedy Algorithms
Points:10
6 votes
Tags:
AlgorithmsBasics of Greedy AlgorithmsGreedy Algorithms
Points:10
14 votes
Tags:
Basic ProgrammingAlgorithmsBasics of Greedy AlgorithmsGreedy Algorithms
Editorial
Login to unlock the editorial
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
Results
Custom Input
Run your code to see the output