## CCC '13 J1 - Next in line

View as PDF

Points: 3
Time limit: 3.0s
Memory limit: 64M

Problem type
##### Canadian Computing Competition: 2013 Stage 1, Junior #1

You know a family with three children. Their ages form an arithmetic sequence: the difference in ages between the middle child and youngest child is the same as the difference in ages between the oldest child and the middle child. For example, their ages could be 5, 10 and 15, since both adjacent pairs have a difference of 5 years.

Given the ages of the youngest and middle children, what is the age of the oldest child?

#### Input Specification

The input consists of two integers, each on a separate line. The first line is the age of the youngest child . The second line is the age of the middle child .

#### Output Specification

The output will be the age of the oldest child.

#### Sample Input 1

12
15

#### Output for Sample Input 1

18

#### Sample Input 2

10
10

#### Output for Sample Input 2

10

• commented on Jan. 10, 2022, 6:14 a.m.

I don’t understand why people state “math puzzles” shouldn’t exist in problem solving challenges.

You are instructing your computer to solve a task for you. It does not matter if its a math problem or a physics question. Programming it relevant to any subject.

Basic Algebra can go the long way:

Formulae: (M “Enter operand” Y)”operand” M = Old_B

Figure it how to convert that into code.

• commented on June 7, 2020, 8:46 p.m.

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

• commented on Jan. 3, 2022, 5:32 p.m. edited

you're right henry, dumb problem. took me a few seconds. tho shouldn't be math in muh coding tbh

• commented on June 8, 2020, 3:21 p.m.

It's not really a coding problem, Henry. I would say its a math puzzle and coding it should be done last. First try to see what the problem is saying, and see how those test cases relate to the problem. For example, how are 12 and 15 related and why does the test case give you an answer of 18? Think about how the answer is formed.