Cod sursa(job #3159530)
Utilizator | Data | 21 octombrie 2023 15:37:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
bool t[20000001];
int main()
{
int n;
int db=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (int i=0; i<n;i++) t[i]=1;
for(int i=2;i<=n;i++){
if(t[i-2]){
for(int j=2*i-2;j<n-1;j+=i){
t[j]=0;
}
}
}
for(int i=0;i<n-1;i++){
if(t[i]){
db++;
}
}
g << db;
g.close();
f.close();
return 0;
}