zoukankan      html  css  js  c++  java
  • java 素数(按要求输出)

    package number;
    import java.util.Scanner;
    public class Prime {
    	public static void main(String[] args) {
    			int i = 0;
    			System.out.println("1.3-100 2.任意两数 3.最大十个和最小十个");
    			Scanner sc = new Scanner(System.in);
    			i = sc.nextInt();
    			switch (i) {
    			case 1:
    				isprime();
    				break;
    			case 2:
    				isprime1();
    				break;
    			case 3:
    				isprime2();
    				break;
    			}
    		}
    
    		public static void isprime() {
    			int n;
    			int i = 2;
    			int m = 0;
    			for (n = 3; n >= 3 && n <= 100; n++) {
    				int j = 0;
    				if (n % 2 == 0)
    					j = 1;
    				for (i = 2; i <= Math.sqrt(n); i++) {
    					if (n % i == 0)
    						j = 1;
    				}
    				if (j == 0) {
    					m++;
    					System.out.print(n + "	");
    					if (m % 5 == 0)
    						System.out.println();
    				}
    			}
    			System.out.println();
    		}
    
    		public static void isprime1() {
    			System.out.println("请输入两个整数:");
    			Scanner sc = new Scanner(System.in);
    			int num1, num2;
    			System.out.println("number1:");
    			num1 = sc.nextInt();
    			System.out.println("number2:");
    			num2 = sc.nextInt();
    			int n;
    			int i = 2;
    			int m = 0;
    			for (n = num1; n >= num1 && n <= num2; n++) {
    				int j = 0;
    				if (n % 2 == 0)
    					j = 1;
    				for (i = 2; i <= Math.sqrt(n); i++) {
    					if (n % i == 0)
    						j = 1;
    				}
    				if (j == 0) {
    					m++;
    					System.out.print(n + "	");
    					if (m % 5 == 0)
    						System.out.println();
    				}
    			}
    		}
    
    		public static void isprime2() {
    			Scanner sc = new Scanner(System.in);
    			System.out.println("请输入两个整数:");
    			int num1, num2;
    			System.out.println("number1:");
    			num1 = sc.nextInt();
    			System.out.println("number2:");
    			num2 = sc.nextInt();
    			System.out.println("十个最小:");
    			int n;
    			int i = 2;
    			int m = 0;
    			int k = 0;
    			int a[] = new int[100];
    			for (n = num1; n >= num1 && n <= num2; n++) {
    				int j = 0;
    				
    				if (n % 2 == 0)
    					j = 1;
    				for (i = 2; i <= Math.sqrt(n); i++) {
    					if (n % i == 0)
    						j = 1;
    				}
    				if (j == 0) {
    					m++;
    					a[m] = n;
    					if (m <= 10)
    						System.out.print(a[m] + "	");
    				}
    			}
    			System.out.println();
    			System.out.println("十个最大:");
    			for (k = m - 10; k <= m; k++) {
    				System.out.print(a[k] + "	");
    			}
    
    		}
    	}
    

      

  • 相关阅读:
    一键清理 Nexus 中无用的 Docker 镜像
    python 获取Linux和Windows硬件信息
    基于Docker安装破解版Jira(无坑)
    vim安装vundle时遇到的问题
    SpringBoot注解大全
    SpringBoot 应用JPA中的一些知识点
    记录初学SpringBoot使用Redis序列化的坑
    Spring Boot连接MySql报错
    钉钉扫码登录中的签名算法在python中的实现
    让Linux的history命令显示用户名和时间
  • 原文地址:https://www.cnblogs.com/zmh-980509/p/9786758.html
Copyright © 2011-2022 走看看