Cod sursa(job #2260692)
Utilizator | Data | 15 octombrie 2018 13:50:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,ciur[2000010],nrprime;
int main()
{ f>>n; ciur[1]=ciur[0]=1;
for(int i = 2 ; i <= n / 2 ; ++i )
if( ciur[i] == 0 )
for(int j = i + 1 ; j <= n ; j*=i ) ciur[j] = 1;
for(int i=1;i<=n;i++)
if( ciur[i] == 1 ) nrprime++;
g<<nrprime;
g.close();
return 0;
}