[aceptaelreto] Add C++ solution for 107 - Aproximación de Gauss

Author: abeaumont

aceptaelreto/107-1.ans

@@ -0,0 +1,6 @@
+Mayor
+Mayor
+Menor
+Mayor
+Mayor
+Menor

aceptaelreto/107-1.in

@@ -0,0 +1,7 @@
+10 3
+750 2
+65535 2
+65535 3
+10000 2
+99999 1
+0 0

aceptaelreto/107.cc

@@ -0,0 +1,29 @@
+// https://www.aceptaelreto.com/problem/statement.php?id=106
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 100000;
+bool composite[N];
+int pi[N];
+
+int main() {
+ cin.tie(0), ios::sync_with_stdio(0);
+ for (int i = 4; i < N; i += 2) composite[i] = 1;
+ for (int i = 3; i < N; i += 2)
+ if (!composite[i])
+ for (int j = i * 2; j < N; j += i) composite[j] = 1;
+ for (int i = 2; i < N; i++) pi[i] = pi[i - 1] + !composite[i];
+ int n, m;
+ while (1) {
+ cin >> n >> m;
+ if (!n && !m) break;
+ double error = pi[n] / double(n) - 1 / log(double(n));
+ if (error < 0) error = -error;
+ for (int i = 0; i < m; i++) error *= 10;
+ if (error == 1) cout << "Igual\n";
+ else if (error < 1)
+ cout << "Menor\n";
+ else
+ cout << "Mayor\n";
+ }
+}

aceptaelreto/README.md

@@ -10,6 +10,7 @@ There are solutions for the following
 1. [104 - Móviles](104.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=104))
 1. [105 - Ventas](105.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=105))
 1. [106 - Códigos de barras](106.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=106))
+1. [107 - Aproximación de Gauss](107.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=107))
 1. [114 - Último dígito del factorial](114.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=114))
 1. [116 - ¡Hola mundo!](116.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=116))
 1. [192 - Por 3 o más 5](192.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=192))