Module: GCD (Greatest Common Divisor)


Problem

9 /10


ordered fractions

Problem

Print in ascending order all irreducible fractions between 0 and 1 whose denominators do not exceed N.

Input 
The first line contains a single number N (\(2 <= N <= 255\)).

Imprint 
One fraction is displayed per line.
 
Examples
# Input Output
1 5 1/5
1/4
1/3
2/5
1/2
3/5
2/3
3/4
4/5

 

time 1000 ms
memory 64 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!