Cod sursa(job #2012457)
| Utilizator | Data | 18 august 2017 20:37:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
FILE *F=fopen("ciur.in", "r"), *G=fopen("ciur.out", "w");
int n, a[2000005], k;
int main()
{
fscanf(F, "%d", &n);
a[1] = a[0] = 1;
for(int i = 2; i <= n; ++ i)
if(!a[i])
for(int j = i+i; j <= n; j += i)
a[j] = 1;
for(int i = 1; i <= n; ++ i)
if(!a[i]) k++;
fprintf(G, "%d", k);
return 0;
}
