Cod sursa(job #2568851)
Utilizator | Data | 4 martie 2020 10:10:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, k;
int main()
{
fin >> n;
int v[n+1];
for(i=2; i<=n; i++)
{
if(v[i]!=1)
k++;
for(j=i+i; j<=n; j=j+i)
v[j]=1;
}
fout << k;
return 0;
}