Cod sursa(job #2036698)
| Utilizator | Data | 10 octombrie 2017 22:58:26 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim[1000000];
int main()
{long long n,i,j,nr=0;
fin>>n;
for(i=2;i<=n;i++)
{
if(!prim[i])
{
for(j=i+i;j<=n;j+=i)
prim[j]=1;
}
if(prim[i]==0)nr++;
}
fout<<nr;
}
