Cod sursa(job #2298843)
Utilizator | Data | 8 decembrie 2018 16:03:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int v[2000000];
int main()
{
int n, k=0;
in>>n;
for(int i=2; i<=n; i++)
{
v[i]=1;
}
for(int i=2; i<=n; i++)
{
if(v[i]==1)
{
for(int j=i+i; j<=n; j+=i)
{
v[j]=0;
}
}
}
for(int i=2; i<=n; i++)
{
if(v[i]==1) k++;
}
out<<k;
return 0;
}