最大公约数(Greatest Common Divisor)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17

#include<iostream>
using namespace std;
int  main(){
    int a,b,gcd;
    cout<<"input number: ";
    cin>>a>>b;
    gcd=a>b?b:a;
    while(gcd>1){
        if(a%gcd==0 && b%gcd==0){  
            break;   
        }
        gcd--;
        }
    cout<<gcd<<endl;
        return 0;
    
}