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
veedee: 2018-06-05 08:30:31

woohoo ac in one go again!!
twice in 1 day

nishant1ranjan: 2018-06-03 15:46:44

@ashish_343 thanks bro

shubhamshree10: 2018-05-29 14:31:28

Asshole question.....
The question setter didn't even put all checks/conditions mentioned in question.

Not worth your time & Try !

launchpad: 2018-05-08 02:14:39

Stupid ass wrong f**king question . The wrong solution gets accepted . The numbers need to be distinct but the solution which got accepted could accept numbers which are equal disqualifying the criteria of non-zero integer as cd or cr . Still the solution got accepted . Such a waste of precious time .

ashish_343: 2018-03-25 23:54:42

ac finally! use b*b=ac intead of any fraction like (b/a)=c/b

Last edit: 2018-03-26 20:12:47
returnofsk: 2018-03-07 06:48:34

can we take inputs and immediately print outputs? I have been trying to take all inputs first then print output.. i am new here

Last edit: 2018-03-07 06:49:18
returnofsk: 2018-03-07 06:27:14

https://ideone.com/baoxOK it shows WA. someone help

Last edit: 2018-03-07 06:38:43
cherub7: 2018-02-26 15:46:13

NOTE: we will limit ourselves to arithmetic progression whose **common difference is a non-zero integer**.

Last edit: 2018-02-26 15:46:39
firoda: 2018-02-17 18:43:31


Last edit: 2018-02-17 19:00:58
quock: 2018-01-27 05:58:41

Just have to take care 0,0,0 , nothing more to ensure.


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