展开全部
修改成Java后的代码:public class Demo {
public static int gcd(int a, int b, int c) {
int min, i;
if(a > b) {
if(b > c) {
min = c;
} else {
min = b;
}
} else {
if(a > c) {
min = c;
} else {
min = a;
}
}
if(b > c) {
if(c > a) {
min = a;
} else {
min = c;
}
} else {
if(b > a) {
min = a;
} else {
min = b;
}
}
if(a > c) {
if(c > b) {
min = b;
} else {
min = c;
}
} else {
if(a > b) {
min = b;
} else {
min = a;
}
}
for(i=min; i>=1; i--) {
if(a%i==0 && b%i==0 && c%i==0) {
break;
}
}
return i;
}
public static void main(String[] args) {
int a = 1, b = 0, c = 0, i, k = 0, j = 0, m = 0, n = 0, z, y;
while(a
b = 1;
while(b
c = 1;
while(c
if(gcd(a,b,c) == 1) {
System.out.println(a + ";" + b + ";" + c);
k++;
z = b*b - 4*a*c;
if(z == 0) {
j++;
} else if(z > 0) {
m++;
for (y=1; y
if (y*y==z) {
System.out.println("解答是有理62616964757a686964616fe4b893e5b19e31333363376539数。");
}
}
} else {
n++;
}
}
c++;
}
b++;
}
a++;
}
System.out.println("N = " + k);
System.out.println("N2 = " + j);
System.out.println("N3 = " + m);
System.out.println("N4 = " + n);
i = gcd(a, b, c);
}
}