Cod sursa(job #1911771)
Utilizator | Data | 7 martie 2017 21:46:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
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 n,nr;
bool prim[2000005];
int main()
{
cin>>n;
for(int i=2;i*i<=n;i++)
{
if(prim[i]==0)
{
nr++;
for(int j=i+1;j<=n;j+=i)
prim[i]==1;
}
}
cout<<nr;
return 0;
}