Cod sursa(job #1602093)
Utilizator | Data | 16 februarie 2016 15:33:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
//#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, cnt=0;
bool ciur[2000005];
cin>>n;
for(int i=2; i<=n; i++){
if(ciur[i]==0){
cnt++;
for(int j=i+i; j<=n; j=j+i)
ciur[j]=1;
}
}
cout<<cnt;
return 0;
}