Cod sursa(job #1524602)
Utilizator | Data | 14 noiembrie 2015 11:53:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
long int n,v[2000005],i,j,nr=0;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
v[1]=0;
for(i=2;i<=n;i++)
{
v[i]=1;
}
for(i=2;i<=n;i++)
{
if(v[i]==1)
{
j=i*2;
nr++;
while(j<=n)
{
v[j]=0;
j=j+i;
}
}
}
fout<<nr;
return 0;
}