rcc-legacy/tests/sysy_lvX/069_greatest_common_divisor.sy


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

int fun(int m,int n){
	int rem;			
	while(n > 0){
		rem = m % n;
		m = n;
		n = rem;
	}
	return m;				
}
int main(){
	int n,m;
	int num;
	m=getint();
	n=getint();
	num=fun(m,n);
	putint(num);

	return 0; 
}