Cod sursa(job #1319890)
Utilizator | Data | 17 ianuarie 2015 14:28:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | oji2015_09_1 | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
ofstream g("ciur.out");
int nr,a[2000001],i,j,N;
int main()
{
freopen("ciur.in", "r", stdin);
scanf("%d" ,&N);
for(i=2;i<=N;i++)
a[i]=1;
for (i=2;i*i<=N;i++)
if (a[i]) for (j=i;j<=N/i;j++)
a[i*j]=0;
for (i=2;i<=N;i++)
if (a[i]) nr++;
g<<nr;
return 0;
}