Cod sursa(job #1552124)
Utilizator | Data | 17 decembrie 2015 11:47:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
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[2000010],i,x,j;
int main()
{
fin >> N;
for(i=2;i<=N;i++)
{
if(v[i]!=1)
x++;
for (j=i;j<=N;j=j+i)
{
if(v[j]%v[i]==0)
v[j]=1;
}
}
fout << x;
return 0;
}