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