The_greatest_common_divisor.rar_The Common_最大公约数

#include <iostream.h> int divisibility( int x , int y) //判断整除性 { int i=x/y; int k=0; if (x==i*y) return k=1; //能整除 else return k=0; //不能整除 } void main() { int x , y ; int j=1; //用于记录最大公约数 cout << "Please enter two integers:" << endl; cin >> x >> y; cout << "x=" << x << " " << "y=" << y << endl; if(x>=y) for(int i=1 ; i<=y ; i++) { if( divisibility(x,i) && divisibility(y,i) ) j=i; } else for(int i=1 ; i<=x ; i++) { if( divisibility(x,i) && divisibility(y,i) ) j=i; } cout << "The greatest common divisor of " << x << " and " << y << " is: " << j <<endl; }