Cod sursa(job #3144809)
Utilizator | Data | 10 august 2023 19:00:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,rs, A[3000000];
int main(){
cin >> n;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
for(int k=2; k<=sqrt(n); k++){
for(int i=2; i<=n; i++){
if(A[i] == 0 && i%k == 0 && i!=k){
A[i] = 1;
// cout << i << ' ' << k << endl;
}
}
}
for(int i=2; i<=n; i++){
if(A[i] == 0){
rs++;
}
}
cout << rs;
}