Skip to Content

Do You Know Your ABCs?

Análisis oficial (C++) 

Solución en video

By Jeffrey Meng

Video de YouTube (yFW8HdG0qAQ)

Código de la solución en video
#include <bits/stdc++.h> using namespace std; int main() { int numbers[7]; for (int i = 0; i < 7; i++) { cin >> numbers[i]; } sort(numbers, numbers + 7); int A = numbers[0]; int B = numbers[1]; int C = numbers[6] - A - B; cout << A << " " << B << " " << C << endl; }
import java.io.*; import java.util.*; public class DoYouKnowYourABCs { public static void main(String[] args) throws IOException { BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(in.readLine()); int[] numbers = new int[7]; for (int i = 0; i < 7; i++) { numbers[i] = Integer.parseInt(st.nextToken()); } Arrays.sort(numbers); int A = numbers[0]; int B = numbers[1]; int C = numbers[6] - A - B; System.out.println(A + " " + B + " " + C); } }

Explicación

Observemos que los dos valores más pequeños de la lista ordenada serán AA y BB, y el valor más grande siempre será igual a A+B+CA + B + C. Restando AA y BB de A+B+CA + B + C, obtenemos el valor de CC.

nums = sorted([int(x) for x in input().split()]) a, b = nums[0], nums[1] c = nums[6] - a - b print(f"{a} {b} {c}")
#include <bits/stdc++.h> using namespace std; int main() { int nums[7]; for (int i = 0; i < 7; i++) { cin >> nums[i]; } sort(nums, nums + 7); int a = nums[0], b = nums[1]; int c = nums[6] - a - b; cout << a << ' ' << b << ' ' << c << '\n'; }
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int nums[] = new int[7]; for (int i = 0; i < 7; i++) { nums[i] = sc.nextInt(); } Arrays.sort(nums); int a = nums[0], b = nums[1]; int c = nums[6] - a - b; System.out.println(a + " " + b + " " + c); } }