Cod sursa(job #1816951)
Utilizator | Data | 27 noiembrie 2016 10:46:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int n,i,j,nr;
int main()
{
fin>>n;
nr=0;
for(i=2;i<=n;i++)
if(v[i]==0){
for(j=i+i;j<=n;j=j+i)
v[j]=1;
nr++;
}
fout<<nr;
return 0;
}