public calss Java01{
public static void main(String [] args){
for(int j=1;j<=9;j++){
System.out.print(i+"*"+j+"="+i*j+" ");
}
System.out.println();
}
}
}
求1000之内的完数
for(int i =1;i <= 1000;i ++ )
{
int sum = 0;
for (int k = 1;k<= (i/2) ;k++)
{
if (i % k== 0)
{
sum += k;
}
}
if(sum == i
{
System.out.println(i);
}
}
求两个数的最大公约数和最小公倍数
Scanner scan=new Scanner(System.in);
system.out.println("请输入两个整数:");
int m=scan.nextInt();
int n=scan.nextInt();
int fan=0,x=m,y=n;
if(m<n){
fan=m;m=n;n=fan;
}
while(m%n!=0) {
fan=m%n;
m=n;
n=fan;
}
System.out.println("最大公约数:"+n);
System.out.print("最小公倍数: "+x*y/n);