Cod sursa(job #2253749)
Utilizator | Data | 4 octombrie 2018 12:40:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<bits/stdc++.h>
using namespace std;
int a[2000010];
vector<int> prim;
int main(){
ifstream in("ciur.in");
ofstream out("ciur.out");
int n , ans = 0;
in >> n ;
for(int i = 2 ; i <= n ; i ++){
if(a[i]==0){
a[i]++;
ans++;
for(int j = i * i ; j <= n ; j += i)
a[j]++;
}
}
out << ans ;
}