Cod sursa(job #2189893)
Utilizator | Data | 29 martie 2018 12:17:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include<fstream>
using namespace std;
int n,rez;
char era[2000005];
int main(){
ifstream fin ("ciur.in");
ofstream fout("ciur.out");
fin >> n;
for(int i=2;i<=n;i++) era[i]=1;
for(int i=2;i<=n;i++){
if(era[i]==1){ rez++;
for(int j=i+i;j<=n;j+=i){
era[j]=0;
}}
}
fout<<rez;
}