Cod sursa(job #2697282)
Utilizator | Data | 18 ianuarie 2021 08:25:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool c[2000001];
void ciur(int x)
{
int k = 0;
c[1]=c[0]=1;
for(int i = 2 ; i * i <= x ; ++i)
for(int j = 2 ; i * j <= x ; ++j)
c[i*j] = 1;
for(int i = 1; i <= x; i++) {
if(c[i] == 0) k++;
}
g << k;
}
int n;
int main()
{
f>> n;
ciur(n);
return 0;
}