[aceptaelreto] Add C++ solution for 103 - Problemas de Herencia

Author: abeaumont

aceptaelreto/103-1.ans

@@ -0,0 +1,5 @@
+ABEL
+ABEL
+CAIN
+JUSTO
+ABEL

aceptaelreto/103-1.in

@@ -0,0 +1,16 @@
+1
+1 0
+100
+3
+1 2 -1 0
+1000
+3
+1 2 -1 1
+1000
+1
+3 -1
+10000
+1
+3 -1
+2
+20

aceptaelreto/103.cc

@@ -0,0 +1,39 @@
+// https://www.aceptaelreto.com/problem/statement.php?id=103
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 20;
+int p[N], n;
+
+double f(double x) {
+ double sum = 0;
+ for (int i = 0; i <= n; i++) {
+ double exp = 1;
+ for (int j = 0; j < i; j++) exp *= x;
+ sum += exp * p[i];
+ }
+ if (sum < 0) return 0;
+ if (sum > 1) return 1;
+ return sum;
+}
+
+int main() {
+ cin.tie(0), ios::sync_with_stdio(0);
+ while (1) {
+ int m;
+ cin >> n;
+ if (n == 20) break;
+ for (int i = 0; i <= n; i++) cin >> p[n - i];
+ cin >> m;
+ double area = 0;
+ for (int i = 0; i < m; i++) {
+ double x = 1 / double(m);
+ area += x * f(x * i);
+ }
+ if (area - 0.5 > 0.001) cout << "CAIN\n";
+ else if (0.5 - area > 0.001)
+ cout << "ABEL\n";
+ else
+ cout << "JUSTO\n";
+ }
+}

aceptaelreto/README.md

@@ -6,6 +6,7 @@ There are solutions for the following
 1. [100 - Constante de Kaprekar](100.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=100))
 1. [101 - Cuadrados diabólicos y esotéricos](101.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=101))
 1. [102 - Encriptación de mensajes](102.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=102))
+1. [103 - Problemas de Herencia](103.cc) ([problem site](https://www.aceptaelreto.com/problem/statement.php?id=103))
 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))