Cod sursa(job #1780480)
Utilizator | Data | 16 octombrie 2016 11:54:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long v[2000000],nr=0,i,j,n;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
for (i=2;i<=n;i++)
{
if (v[i])
{
for(j=i*i;j<=n;j+=i)
v[j]=1;
}else ++nr;
}
fout<<nr;
return 0;
}