Cod sursa(job #2383824)
Utilizator | Data | 19 martie 2019 20:10:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,j,i,nr;
short pr[2000005];
int main()
{
f>>n;
for(i=2; i*i<=n; i++)
{
if(pr[i]==0)
{
for(j=2*i; j<=n; j=j+i)
pr[j]=1;
}
}
for(int i=2; i<=n; i++)
if(pr[i]==0)
nr++;
g<<nr;
return 0;
}