Cod sursa(job #1690535)
Utilizator | Data | 15 aprilie 2016 11:20:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin ("ciur.in");
ofstream cout("ciur.out");
bool a[2000005];
int n,rs;
int main(){
cin >> n;
rs=n-1;
for(int i=2; i<=sqrt(n); i++)
if(a[i]==0)
for(int j=i; j*i<=n; j++){ a[i*j]=1; rs--;}
cout << rs;
return 0;
}