Cod sursa(job #2053916)
Utilizator | Data | 1 noiembrie 2017 15:18:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
bool v[2000005];
int i, j, n;
long long c=0;
in>>n;
for (i=2; i<=n; i++)
v[i]=1;
for (i=2; i<=n; i++)
if (v[i]!=0)
{
c++;
for (j=i+i; j<=n; j+=i)
v[j]=0;
}
out<<c;
return 0;
}