Cod sursa(job #2504635)
Utilizator | Data | 5 decembrie 2019 12:07:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
short int p[2000001];
int main()
{
int i,n,c=0,j;
f>>n;
for (i=2;i<=n;i++)
{
if (p[i]==0)
{
for (j=2*i;j<=n;j=j+i)
p[j]=1;
}
}
for (i=2;i<=n;i++)
{
if (p[i]==0)
c++;
}
g<<c;
return 0;
}