Cod sursa(job #3237792)
Utilizator | Data | 13 iulie 2024 11:19:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
int dfs(int n){
int ans = 0;
int dp[n+1];
memset(dp,1,sizeof(dp));
for(int i = 2;i<=n;i++){
if(dp[i]) {
ans++;
for(int j = 2*i;j<=n;j+=i) dp[j] = 0;
}
}
return ans;
}
int main() {
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
cin >> n;
cout << dfs(n);
return 0;
}