两个整数内容交换
public class Chap2{
public static void main(String[] args){
int a=2;
int b=3;
System.out.println("原a:"+a);
System.out.println("原b:"+b);
int c=a;
a=b;
b=c;
System.out.println("交换后a:"+a);
System.out.println("交换后b:"+b);
}
}
能否被3、5、7整除
public class Test4{
public static void main(String args[]){
int a=11;
if(a%3==0){
System.out.println(a+"能被3整除");
}
else if(a%5==0){
System.out.println(a+"能被5整除");
}
else if(a%7==0){
System.out.println(a+"能被7整除");
}
else{
System.out.println(a+"不能被3、5、7整除");
}
}
}
求13-23+33-43+…+973+993-1003的值
//法1
//求13-23+33-43+…+973-983+993-1003的值
public class Chap3{
public static void main(String[] args){
int a=0;
int sum=0;
for(int i=1;i<=100;i++){
a=i*10+3;
if(i%2!=0){
sum=sum+a;
}
if(i%2==0){
sum=sum-a;
}
}
System.out.println("13-23+33-43+…+973-983+993-1003="+sum);
}
}
//法2
public class Test3 {
public static void main(String[] args) {
int sum=0,i=13,j=23;
while(i<=1003) {
sum +=(i-j);
i=i+20;
j=j+20;
}
System.out.println("13-23+33-43+…+973-983+993-1003="+sum);
}
}
实现两个数字的交换
public class Test7{
public static void main(String args[]){
int a=6,b=9;
int c;
System.out.println("交换前a:"+a);
System.out.println("交换前b:"+b);
c=a;
a=b;
b=c;
System.out.println("交换后a:"+a);
System.out.println("交换后b:"+b);
}
}
1~1000内能同时被3、5、7整除的数
public class Test10{
public static void main(String args[]){
for(int i=1;i<=1000;i++){
if(i%3==0&i%5==0&i%7==0){
System.out.println(i+"能被3、5、7整除");
}
}
}
}
//求1!+2!+…+20!的值
public class Test4 {
public static void main(String[] args) {
long sum=0;
long factorial=1;
for(int i=1;i<=20;i++){
factorial*=i;
sum+=factorial;
}
System.out.println("1!+2!+...+20!="+sum);
}
}
用for循环打印下面图形:
*
class Test12{
public static void main(String[] args){
for(int i=1;i<=5;i++){
for(int j=0;j<5-i;j++){
System.out.print(" ");
}
for(int k=1;k<=i;k++){
System.out.print("* ");
}
System.out.println(" ");
System.out.println(" ");
}
}
}