Cod sursa(job #1886704)
| Utilizator | Data | 21 februarie 2017 08:45:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,nr;
bool v[2000001];
void ciur(){
int i,j;
for(i=2;i<=n;i++)
v[i]=true;
i=2;
while(i<=n){
if(v[i]==true){
j=i+i;
while(j<=n){
v[j]=false;
j+=i;
}
}
i++;
}
}
int main(){
fin>>n;
fin.close();
ciur();
for(int i=2;i<=n;i++)
if(v[i]==true)
nr++;
fout<<nr;
fout.close();
return 0;
}
