Cod sursa(job #1498821)
Utilizator | Data | 9 octombrie 2015 12:16:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,sum=0;
fin>>n;
bool v[2000007];
for(int i=0;i<n;++i){
v[i]=0;
}
for(int i=2;i<=n;++i){
if(v[i]==0){
sum++;
for(int j=i*i;j<=n;j+=i){
v[j]=1;
}
}
}
fout<<sum;
}