Cod sursa(job #3362982)
| Utilizator | Data | 13 august 2026 11:59:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
using namespace std;
const int N=2000001;
int ciur[N+1];
void Ciur(int n){
ciur[1]=ciur[0]=1;
for(int i=2;i<=n;i++){
if(ciur[i]==0){
for(int j=i*2;j<=n;j+=i){
if(ciur[j]==0){
ciur[j]=1;
}
}
}
}
}
int main(){
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n,cnt=0,i;
cin>>n;
Ciur(n);
for(i=0;i<=n;i++){
if(ciur[i]==0){
cnt++;
}
}
cout<<cnt;
return 0;
}
