Cod sursa(job #1840451)
Utilizator | Data | 4 ianuarie 2017 14:15:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long contor,i,j;
int main()
{
bool x[2000001];
int n;
fin>>n;
for(i=1; i<=n; ++i)
{
x[i]=1;
}
for(i=2;i<=n;++i)
{
if(x[i]==1)
{
contor+=1;
for(j=i*i;j<=n;j=j+i)
{
x[j]=0;
}
}
}
fout<<contor;
return 0;
}