FR | EN
Quentin L. Meunier
Associate Professor in Computer Science at Sorbonne Université

Problem 1003

In front of the menu of this gourmet restaurant (all prices are whole numbers of euros), Alice, who wants to order two dishes, hesitates. She calculates what each of the six two-dishes combinations of the four she prefers would cost, and decides to choose between the four cheapest combinations, whose prices are:

59 €, 65 €, 66 € and 69 €.

Bob, meanwhile, hesitates between five dishes, not necessarily the same as Alice. He calculates the amounts of ten combinations of two dishes among those he prefers. The five lowest amounts are:

56 €, 64 €, 66 €, 69 € and 70 €.

If there is more than one solution, fill one line per solution by ordering the numbers in column A by increasing values.

I did not do any program for this problem



  • The four dishes chosen by Alice are cost (in euros): 29, 30, 36, 40 (1A to 1D).
  • The five dishes chosen by Bob cost (in euros):
    • 2A to 2D: 25, 31, 39, 41 (and 44 for the most expensive);
    • or 3A to 3D: 27, 29, 37, 42 (and 43 for the most expensive).