ACPC10A - What’s Next

According to Wikipedia, an arithmetic progression (AP) is a sequence of numbers such that the difference of any two successive members of the sequence is a constant. For instance, the sequence 3, 5, 7, 9, 11, 13 ... is an arithmetic progression with common difference 2. For this problem, we will limit ourselves to arithmetic progression whose common difference is a non-zero integer.

On the other hand, a geometric progression (GP) is a sequence of numbers where each term after the first is found by multiplying the previous one by a fixed non-zero number called the common ratio. For example, the sequence 2, 6, 18, 54 ... is a geometric progression with common ratio 3. For this problem, we will limit ourselves to geometric progression whose common ratio is a non-zero integer.

Given three successive members of a sequence, you need to determine the type of the progression and the next successive member.

Input

Your program will be tested on one or more test cases. Each case is specified on a single line with three integers (−10, 000 < a1, a2, a3 < 10, 000) where a1, a2, and a3 are distinct.

The last case is followed by a line with three zeros.

Output

For each test case, you program must print a single line of the form:
XX v
where XX is either AP or GP depending if the given progression is an Arithmetic or Geometric Progression. v is the next member of the given sequence. All input cases are guaranteed to be either an arithmetic or geometric progressions.

Example

Input:
4 7 10
2 6 18
0 0 0

Output:
AP 13
GP 54

Added by:Omar ElAzazy
Date:2010-11-30
Time limit:1.799s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:ACPC 2010

hide comments
2013-03-20 17:22:18 Divya Gupta
such a time waste
2013-03-17 12:50:36 driller
its giving wa pplease tell any special case if any
2013-01-08 19:19:04 olf
getting TLE
2012-11-12 03:35:48 Geronimo De Abreu
take care about the stop condition...
while(a+b+c != 0) wont work
2012-10-22 12:45:03 gourav
i think world's most easiest problem is here... come on guys !! ;)
2012-09-27 02:07:32 hua
If anyone needs some help with this problem, I wrote a quick explanation at <gone>

Last edit: 2022-08-10 15:41:49
2012-09-08 06:30:03 shibani
s t necessary that a1<a2<a3??

Last edit: 2012-09-08 06:30:27
2012-09-01 11:17:29 A.Rajkumar
idone all perfectly but still i getting wrong answer which is perfectly working in linux
2012-07-31 14:52:27 abc
output for 9 3 1 ? 0 or 0.33333 ?
2012-07-23 12:56:13 Shaik Shoeb
one of the easiest problems in spoj that i have come across. :)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.