Cod sursa(job #2380730)
Utilizator | Data | 15 martie 2019 14:37:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
int v[2000000];
int main(){
int n,i,j,k,m=0;
cin>>n;
for(i=2; i<=n; i++){
for(j=i+1; j<=n; j++){
if(v[j]==0 && j%i==0){
v[j]++;
}
}
}
for(k=2; k<=n; k++){
if(v[k]==0){
m++;
}
}
cout<<m;
return 0;
}