Cod sursa(job #2108025)
Utilizator | Data | 17 ianuarie 2018 20:56:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
bool v[2000001];
int main()
{f>>n;
v[0]=1;
v[1]=1;
for(int i=2;i*i<=n;i+=2)
{int c=i;
if(v[i]==0)
{
while(c<=n)
{c=c+i;
v[c]=1;
}
if(i==2)
i--;
}
}
for(int i=1;i<=n;i++)
if(v[i]==0)
nr++;
g<<nr;
return 0;
}