Cod sursa(job #1579487)
Utilizator | Data | 24 ianuarie 2016 20:00:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char v[2000000];
int N,i,j,nr;
int main()
{
f>>N;
for(i=2;i<=N;i++)
{v[i]=1;
}
for(i=2;i<=N;i++)
{if(v[i]==1)
{
nr++;
for(j=2*i;j<=N;j+=i)
v[j]=0;
}
}
g<<nr;
return 0;
}