Cod sursa(job #2200909)
Utilizator | Data | 2 mai 2018 21:30:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long i,prim[2000000],n,j,nr=0;
int main()
{ f>>n;
for(i=2;i<=n;i++)prim[i]=1;
for(i=2;i<=n;i++)
{
if(prim[i]!=0)
{
nr++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
}
g<<nr;
}