Cod sursa(job #1169348)
Utilizator | Data | 10 aprilie 2014 22:57:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[2000100];
int k;
int main()
{
int i,j,n;
fin>>n;
for (i=2;i<=2000000;++i)
if (v[i]==0)
for (j=2*i;j<=n;j+=i)
v[j]=1;
for (i=2;i<=n;++i)
if (v[i]==0) k++;
fout<<k;
return 0;
}