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