Skip to content

AmmarAli12369001/Greatest_Common_Divisor

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Greatest Common Divisor We say that an integer D is a divisor of another integer A if the fraction A/D is also an integer. Given two positive integers A and B, compute the largest number which is a divisor of both A and B.

Standard input The first line contains the two integers A and B.

Standard output Output a single number representing the greatest common divisor.