Cod sursa(job #1961927)
Utilizator | Data | 11 aprilie 2017 14:29:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,i,nr=0,j;
bool ciur[2000001];
int main()
{
in>>n;
for(i=2;i<=sqrt(n);i++)
for(j=2*i;j<=n;j=j+i)
ciur[j]=1;
for(i=2;i<=n;i++)
if(ciur[i]==0)
nr++;
out<<nr;
return 0;
}