Cod sursa(job #2298901)
Utilizator | Data | 8 decembrie 2018 16:39:45 | |
---|---|---|---|
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 in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000005];
int main()
{
int n,i,j,contor=0;
in>>n;
for (i=2; i<=n; i=i+1)
v[i]=1;
for (i=2; i<=n; i=i+1)
if(v[i])
{
contor++;
for(j=i+i; j<=n; j=j+i)
v[j]=0;
}
out<<contor;
return 0;
}