201111621321
class Max{
public int a,b;
public static void main(String args[]){
public Max(int a,int b;){
this.a=a;
this.b=b;
}
if(a>b){
a-b
}
}
}
完善后的程序:
package suanfa;
import java.util.Scanner;
public class TextGcb {
public int gcb(int a,int b){
int r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
public static void main(String args[]){
TextGcb ss = new TextGcb();
Scanner scan=new Scanner(System.in);
System.out.println("请输入一个整数:");
int first=scan.nextInt();
int tmp=first*2;
while(tmp <= 0||tmp%2!=0){
System.out.println("请重新输入:");
first=scan.nextInt();
}
System.out.println("请输入另一个整数");
int second=scan.nextInt();
tmp=second*2;
while(tmp<0||tmp%2!=0){
System.out.println("请重新输入:");
second=scan.nextInt();
}
System.out.println("这两个数的公约数为:"+ss.gcb(first, second));
}
}