Cod sursa(job #1877892)
Utilizator | Data | 13 februarie 2017 19:27:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<bits/stdc++.h>
using namespace std;
long int x,k=0;
bool f[2001001];
int main(){
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>x;
for(int i=2;i<=x;i++)
f[i]=1;
for(int i=2;i<=x;i++){
if(f[i]){
k++;
for(int j=2*i;j<=x;j=j+i) f[j]=0;
}
}
cout<<k;
return 0;
}