Cod sursa(job #2152594)
Utilizator | Data | 5 martie 2018 18:02:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int n,nr,i,j;
bool ciur[2000005];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
nr=0;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i<=n;i++)
{
if(ciur[i])
{
nr++;
for(j=2*i;j<=n;j=j+i)
ciur[j]=0;
}
}
g<<nr;
f.close();
g.close();
return 0;
}