Cod sursa(job #1736398)
Utilizator | Data | 1 august 2016 17:39:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
bool a[2000000];
int i,j,n;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
f.close();
for(i=2;i<=trunc(sqrt(n));i++)
if (a==0)
{ j=2;
do
{ a[i*j]=1;
j++;}
while (j*i<n);
}
i=0;
for(j=2;j<=n;j++)
if (a[j]==0) i++;
i--;
g<<i;
g.close();
return 0;
}