Cod sursa(job #1108239)
Utilizator | Data | 15 februarie 2014 15:11:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool p[2000005];
int main()
{
int i, j, n, nr=0;
f>>n;
for(i=2;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++)
if(p[i])
{
nr++;
for(j=i*i; j<=n; j=j+i)
p[j]=0;
}
g<<nr;
return 0;
}