Cod sursa(job #1916952)
| Utilizator | Data | 9 martie 2017 10:45:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 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]=i;
for(i=2;i<=n;i++)
{
for(j=i+1;j<=n;j++)
if(v[j]!=0 && v[j]%i==0)
v[j]=0;
}
for(i=1;i<=n;i++)
if(v[i]!=0)
nr++;
fout<<nr;
return 0;
}
