divisor1.cc

来自「做为SD0609的一员,我扎实的基础是如何打出来的,来看看我那时连猴子选大王都不」· CC 代码 · 共 21 行

#include <iostream>
using namespace std;

int divisor(int m,int n){
	for(int i=m; i>=1; i--){
		if(m%i==0 && n%i==0){
			return i;
		}	
	}
	return 1;
}

int main(){
	cout <<"80,60: " << divisor(80,60) << endl;	
	int a,b;
	cin >> a >> b;
	cout << "inputed integer;" << a << " " << b << endl;
	cout << "the max of gong yue shu; " << divisor(a,b) << endl;
	return 0;
}