Cod sursa(job #2529379)
Utilizator | Data | 23 ianuarie 2020 12:46:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
vector <int> v;
int main()
{
int n, k=0;
fin >> n;
v.resize(n+1);
for(int i=2; i<=n; i++)
if(v[i] == 0)
{
for(int j = i+i; j<=n; j+=i)
v[j]=1;
k++;
}
fout << k;
return 0;
}