Cod sursa(job #2393728)
Utilizator | Data | 31 martie 2019 22:05:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int MAX=2e6+1;
bool v[MAX];
int main()
{
int n;
in>>n;
int s=0;
for(int i=2;i<=n;i++){
if(v[i]==0){
for(int j=i+i;j<=n;j+=i){
v[j]=1;
}
s=s+1;
}
}
out<<s;
return 0;
}