Cod sursa(job #2150423)
Utilizator | Data | 3 martie 2018 15:48:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int a[2000005];
int n,k,i,nrprim;
int main()
{
f>>n;
for(i=2;i<=n;i++)
{
if(a[i]==0)
{
a[i]=1;
for(k=2;k*i<=n;k++)
{
a[k*i]=2;
}
nrprim++;
}
}
g<<nrprim;
return 0;
}