Cod sursa(job #622128)
Utilizator | Data | 17 octombrie 2011 14:25:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
const int NR = 2000001;
bool v[NR];
int main()
{
int N,j,i,nr;
nr=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>N;
for(i=2;i<=N;i++)
{
if(!v[i])
for(j=i*i;j<=N;j+=i)
v[j]=true;
}
for(i=2;i<=N;i++)
if(!v[i])
nr++;
g<<nr;
return 0;
}