Cod sursa(job #629442)
| Utilizator | Data | 3 noiembrie 2011 13:13:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
//#include<iostream>
#include<fstream>
using namespace std;
bool v[2000001];
int main ()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,nr=0;
fin>>n;
for (int i=2;i<=n;i++)
{
if (v[i]==0)
{
for (int j=i+i;j<=n;j+=i)
v[j]=1;
nr++;
}
}
fout<<nr;
fin.close(); fout.close();
return 0;
}