Cod sursa(job #2367281)
Utilizator | Data | 5 martie 2019 09:54:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | pregatire_cls9_ojiii | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool x[2000000]={0};
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,db=0;
f >> n;
int x[n]={0};
x[0]=1;
x[1]=1;
for (int i=2;i*i<=n;i++){
if (x[i]==0){
for (int j=i;j<=n/i;j++){
x[i*j]=1;
}
}
}for (int j=0;j<=n-1;j++){
if (x[j]==0)
db++;
}g << db;
g.close();
return 0;
}