1013. 数素数 (20)

来源：互联网发布：俄罗斯杜马选举知乎编辑：程序博客网时间：2024/06/18 05:48
//javaimport java.util.Scanner;public class Main {    public static void main(String[] args){        Scanner scanner = new Scanner(System.in);        int m = scanner.nextInt();        int n = scanner.nextInt();        int count = 0 ;        for(int i = 1 ;  ; ++i){            if(isPrimeNum(i)){                count++;                if(count >= m && count <= n){                    if((count-m+1) % 10 == 0 || count - m == n - m){                        System.out.println(i);                    }else{                        System.out.print(i + " ");                    }                }                if(count == n){                    break;                }            }        }    }    public static boolean isPrimeNum(int a){        if(a == 1){            return false;        }        if(a % 2 == 0 && a != 2){            return false;        }        for(int i = 3; i <= Math.sqrt(a); i+=2){            if(a % i == 0){                return false;            }        }        return true;    }}//C语言#include<stdio.h>#include<math.h>int isPrimeNum(int a);int main(){    int m , n , i;    scanf("%d %d" ,&m ,&n);    int count = 0 ;        for(i = 1 ;; ++i){            if(isPrimeNum(i) == 1){                count++;                if(count >= m && count <= n){                    if((count-m+1) % 10 == 0 || count - m == n - m){                        printf("%d\n",i);                    }else{                        printf("%d ",i);                    }                }                if(count == n){                    break;                }            }        }        return 0;}int isPrimeNum(int a){    int num = (int)sqrt(a);    int j;       if(a == 1){        return 0;       }       if(a % 2 == 0 && a != 2){        return 0;       }       for(j = 3 ; j <= num; ++j){        if(a % j == 0){            return 0;        }       }       return 1;    }
阅读全文
0 0