## Appleby Contest '19 P1 - Darcy's Debilitating Demands

View as PDF

Points: 3 (partial)
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type

Darcy (a former taxi driver) now works at a factory crunching numbers for calculations. Despite his superior intellect and mathematical abilities, he still finds his job of calculating and computing very cumbersome and difficult.

Today he has to complete tasks, each in the following format:

Given four numbers , find three numbers that sum up to , with the following restrictions:

• The first number must be an integer between and (inclusive)
• The second number must be an integer between and (inclusive)
• The third number must be an integer between and (inclusive)

Darcy has been feeling very pooped lately, can you help him find the three numbers for each task?

#### Input Specification

The first line will contain the integer , the number of tasks. tasks will follow in the next lines.

The first line of each task will contain the integer .

The next three lines of each task will contain three integers: .

#### Output Specification

For each task, output three integers that sum up to and satisfy the above constraints, or -1 if that is not possible.

If there are multiple solutions, output the one such that earlier numbers are minimized. Note that is considered to be before and and is considered to be before .

#### Sample Input

1
100
100
53
49

#### Sample Output

0 51 49

#### Explanation

Note that there is only one task in the sample.

While 98 1 1 also sums up to , the earlier numbers should be as small as possible.

• commented on Dec. 17, 2020, 7:19 a.m.

Just consider the relationships among a,b,c

• commented on Oct. 26, 2020, 4:55 a.m.

This comment is hidden due to too much negative feedback. Click here to view it.

• commented on Oct. 26, 2020, 8:38 a.m.

My Python solution passes in <0.09s in the worst case... the time limit is very generous

• commented on Aug. 10, 2020, 5:52 p.m. edited

Why isn't the expected output ?

100 0 0

Edit: Sorry I didn't read the whole question!

• commented on Aug. 1, 2020, 12:48 p.m.

This comment is hidden due to too much negative feedback. Click here to view it.

• commented on Sept. 3, 2020, 11:35 a.m.

Free points then

• commented on Aug. 2, 2020, 11:58 a.m.

It wasn't meant to be hard.