Cod sursa(job #1500385)
Utilizator | Data | 11 octombrie 2015 20:47:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i, j, k = 0, n;
f >> n;
int v[n+1];
for (i = 2; i <= n; i++){
v[i] = 1;
}
for (i = 2; i <= n; i++){
if (v[i]){
k++;
for (j = i + i; j <= n; j += i){
v[j] = 0;
}
}
}
g << k;
return 0;
}