Cod sursa(job #2298858)
Utilizator | Data | 8 decembrie 2018 16:11:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000005];
int main()
{
int n,s=0;
in>>n;
for(int i=2;i<=n;i++){
v[i]=1;
}
for(int i=2;i<=n;i++){
if(v[i]==1){
s++;
for(int j=i+i; j<=n;j+=i){
v[j]=0;
}
}
}
out<<s;
return 0;
}