Cod sursa(job #1805578)
Utilizator | Data | 13 noiembrie 2016 22:55:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
# include <bits/stdc++.h>
using namespace std;
int n, p;
bool a[2000005];
int main(){
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
p=0;
for (int i = 2; i<=n; i++){
if (!a[i]){
p++;
for (int j = i+ i; j<=n; j+=i ){
a[j]= true;
}
}
}
cout<<p+2;
return 0;
}