Cod sursa(job #2347459)
Utilizator | Data | 18 februarie 2019 20:07:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.23 kb |
#include <iostream>
#include <cmath>
using namespace std;
int n,x,i,v[1000],nr;
int main()
{cin>>n;
for(i=2;i<=sqrt(n);i++){
if(v[i]==0) {x=i*i;
while(x<=n){v[x]=1;x=x+i;}
}
}for(i=2;i<=n;i++){
if(v[i]==0) nr++;
}cout<<nr;
}