<b><span>Input</span> </b> 

<span> 一个整数n <br />

<b><span>Output</span> </b> 

<span> 由小到大输出N以内的所有素数 <br />

<b><span>Sample Input</span> </b> 

样例输入1
10

<b><span>Sample Output</span> </b> 

<b><span>Hint</span> </b> 

C++解答

#include<iostream>
using namespace std;
int n,c=0;
int main(){
    cin>>n;
    for(int i=2;i<=n;i++){
            for(int j=2;j<=i-1;j++)
            if(i%j==0) c++;
            if(c==0) cout<<i<<endl;
            c=0;
            }
    return 0;
}

Java解答

import java.util.*;

public class Main{
  public static void main(String[] args) {
    Scanner cin = new Scanner(System.in);
    int n = cin.nextInt();
    for(int i = 0; i <= n; i ++){
      if(isPrime(i)){
        System.out.println(i);
      }
    }
  }

  public static boolean isPrime(int n){
    if(n == 1 || n ==0){
      return false;
    }
    for(int i = 2; i <= (int)Math.sqrt(n); i ++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}