Cod sursa(job #1916836)
Utilizator | Data | 9 martie 2017 10:29:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,v[785000],j,i,ap;
int main()
{
fin>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
{
if(v[i])
{
ap++;
for(j=2*i;j<=n;j+=i)
v[j]=0;
}
}
fout<<ap;
return 0;
}