Cod sursa(job #3288964)
Utilizator | Data | 24 martie 2025 23:36:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | java | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
import java.io.*;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
try (Scanner scanner = new Scanner(new FileInputStream("ciur.in"));
PrintWriter pw = new PrintWriter(new FileOutputStream("ciur.out"))) {
int N = scanner.nextInt();
boolean[] prime = new boolean[2000005];
int nr = 0;
for (int i = 2; i <= N; i++) {
if (!prime[i]) {
nr++;
for (int j = i + i ; j <= N; j += i) {
prime[j] = true;
}
}
}
pw.println(nr);
}
}
}