Cod sursa(job #2376115)
Utilizator | Data | 8 martie 2019 13:42:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <cmath>
using namespace std;
bool v[2000002];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j;
fin>>n;
int x=sqrt(n);
v[0]=v[1]=1;
int nr=0;
int y=n/2;
for (i=2;i<=y;i++)
{
j=2;
if (v[i]==0)
{
nr++;
while(i*j<=n)
{
v[i*j]=1;
j++;
}
}
}
fout<<nr;
return 0;
}