ACPC10A - What’s Next

no tags 

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

hide comments
Souvik Mondal : 2015-03-06 16:25:58

can someone give other test cases.
i am repeatedly getting wrong answer,although my outputs are correct.
and is the output format correct?
printf("AP %.0lf\n",nxt[j]);

Last edit: 2015-03-06 16:26:26
Archit Kapoor: 2015-01-18 19:44:34

Thanks Dushyant Singh for the great help..!!

Maverick: 2015-01-15 06:42:43

Guys Dont we need to first take in Input,Store them till we get 0 0 0 and then Display the outputs?!!!
Astonishingly,My 5 solutions were TA Until I just took inputs and directly displayed them one by one.

Last edit: 2015-01-15 06:42:57
Dushyant Singh: 2015-01-14 22:09:39

Got AC in 9th attempt! Write (2*b)==(a+c) instead of b==(a+c)/2 and change all variables type to int instead of short int.

Last edit: 2015-03-24 14:04:58
Mayank Attri: 2015-01-10 21:10:48

Very Simple.... AC in 1st go.

Raj Kumar Chauhan: 2015-01-10 14:59:00

do we have to consider increasing decreasing series both?

Aseem Arora: 2015-01-06 23:46:59

I tried to submit the solution in both c and c++ but it shows an error everytime saying that these languages are only available in cube cluster .But if you see the all submissions page , there are accepted solutions written in these languages.I am confused by this . Can anyone please explain ?

Ravin: 2015-01-05 19:14:16

AP- difference is same
GP - ratio is same
easy..

Abhishek Naik: 2015-01-04 14:07:01

So how did Raman Nv submit the answer then?

Rahul: 2015-01-04 12:07:25

Same Problem occurred to me as well :"Pyramid Cluster is unavailable"


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