Cod sursa(job #1413240)
| Utilizator | Data | 1 aprilie 2015 19:08:10 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,k,nr;
bool v[2000004]={false};
int main()
{
fin>>n;
for(i=2;i<=n;i++)
{
if(v[i]==false)
{
nr++;
for(k=1;i*k<=n;k++)
v[i*k]=true;
}
}
fout<<nr;
return 0;
}
