//C++程序如下:
#include<cstdio>
int GCD(int a,int b)
{
return a%b?GCD(b,a%b):b;
}
int main()
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d",GCD(x,y));
return 0;
}
programgcd;
var
k,a,b:integer;
functiongcd(a,b:integer):integer;
begin
ifamodb=0thenexit(b)
elsegcd:=gcd(b,amodb);
end;
begin
readln(a,b);
k:=gcd(a,b);
writeln(k);
end.
JAVA(野生的~~~)
import java.util.Scanner;
public class Six {
public static void main(String[] args) {
System.out.print("请输入a和b");
Scanner scan = new Scanner(System.in);//以空格作为分隔符
int a = scan.nextInt();
int b = scan.nextInt();
int middle1,middle2,middle3;
middle1=a;
middle2=b;
middle3=0;
for (int i=0;i<i+1;i++) {
middle3=middle1%middle2;
if(middle3==0)
break;
else{
middle1=middle2;
middle2=middle3;
}
}
System.out.println("最大公约数为:"+middle2);
}
}
Py
def gcd(n1,n2):
"""greatest common divisor function """
if(n1%n2 == 0):
return n2
return gcd(n2,n1%n2)