Cod sursa(job #2340443)
Utilizator | Data | 10 februarie 2019 14:13:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000002];
int main()
{
int n;
int nr=0,i,j;
in>>n;
for(i=2; i<=n; i++)
{
if(v[i]==0)
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
for(i=2; i<=n; i++)
if(v[i]==0)
nr++;
out<<nr;
return 0;
}