一、运用辗转相除法求两个数的最大公约数:
import javax.rmi.ssl.SslRMIClientSocketFactory;
import java.util.Scanner;
//求两个数的最大公约数(辗转相除法)
public class gongyueshu {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println("请输入第一个数");
int a=sc.nextInt();
System.out.println("请输入第二个数");
int b=sc.nextInt();
int c=0;
while (a%b!=0){
c=a%b;
a=b;
b=c;
}
System.out.println("最大公约数"+b);
}
}
计算1/1-1/2+1/3-1/4+1/5...+1/99-1/100:
import java.util.Scanner;
import java.util.Scanner;
public class lianxi {
//计算1/1-1/2+1/3-1/4+1/5...+1/99-1/100
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int a= sc.nextInt();
double sum=0;
int flg=1;
for (int i = 1; i <= a; i++) {
sum=sum+1.0/i*flg;
flg=-flg;
}
System.out.println(sum);
}
}
模拟密码登录(三次机会):
public class lianxi {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count=3;
while(count!=0){
System.out.println("请输入你的密码:");
String password = sc.nextLine();
if(password.equals("123456")){
System.out.println("密码正确,登陆成功");
break;
}else {
count--;
System.out.println("还有"+count+"次机会");
}
}
}
判断99以内共包含多少个数字9:
public class lianxi { //99以内包含多少个9
public static void main(String[]args){
int count=0;
for (int i = 1; i <= 100; i++) { //99
if (i/10==9){
count++;
}else if(i%10==9){
count++;
}
}
System.out.println(count);
}
}
判断一个数的二进制中包含多少个1(两种方法):
1.
public class lianxi {//求二进制中一的个数
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int count=0;
for (int i = 0; i < 32; i++) {
if(((n>>i&1)==1)){
count++;
}
}
System.out.println("count:"+count);
}
2.
public class lianxi {//求二进制中一的个数
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int count=0;
while (n!=0){
n=n&(n-1);
count++;
}
System.out.println(count);
}
}
设计一个范围是0-10的猜数字游戏,并输出猜的次数:
import java.util.Random;
import java.util.Scanner;
public class caishu {
public static void main(String[] args) {
Random sj=new Random();
int num;
num=sj.nextInt(11);//suiji[0,10]
Scanner in = new Scanner(System.in);
int cai;
int j = 0;
while (true) {
System.out.println("请输入你猜的那个数:");
cai = in.nextInt();
if (cai == num) {
System.out.println("恭喜呀!猜对了!!");
break;
} else if (cai < num ) {
System.out.println("猜小了哦");
} else if (cai > num) {
System.out.println("猜大了呀");
}
j++;
}
System.out.println("一共输入了"+(j+1)+"次");
}
}
类似的还有(石头剪刀布)猜拳游戏:
import java.util.Random;
import java.util.Scanner;{
int num;
Scanner in = new Scanner(System.in);
Random sj = new Random();
num=sj.nextInt(3);
int cai;
while (true){
System.out.println("请输入你出的拳1:石头,2:剪刀,3:布");
cai= in.nextInt();
if(cai==num){
System.out.println("平局哟");
}
if(cai==1 && num==2){
System.out.println("你出了石头,电脑是剪刀,恭喜你!赢啦!");
}
if(cai==1&&num==3){
System.out.println("你出了石头,电脑是布,你输了。");
}
if(cai==2&&num==1){
System.out.println("你出了剪刀,电脑是石头,你输了。");
}
if(cai==2&&num==3){
System.out.println("你出了剪刀,电脑是布,恭喜你!赢啦!");
}
if(cai==3&&num==1){
System.out.println("你出了布,电脑是石头,恭喜你!赢啦!");
}
if(cai==3&&num==2){
System.out.println("你出了布,电脑是剪刀,你输了。");
}
}
}
输出正反的乘法表:
public class chengfabiao {
public static void main(String args[]) {
System.out.println("乘法口诀:");
for (int i = 1; i <= 9; i++) {
for (int j = 1; j < i + 1; j++) {
System.out.printf("%dx%d=%d ", j, i, i * j);
}
System.out.println();
}
System.out.println();
for (int i = 9; i > 0; i--) {
for (int j = 1; j <= i; j++) {
System.out.printf("%dx%d=%d ", j, i, i * j);
}
System.out.println();
}
}
}
逢七过
public class jisuan{
public static void main(String[] args) {
for ( int j = 1; j <=100; j++) {
if(j%7==0||j%10==7||j/10%10==7){
System.out.println("过");
continue;
}
System.out.println(j);
}
}
}