1 solutions
-
0
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; } }
- 1
Information
- ID
- 18752
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By