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
hide comments
Dario Sindicic:
2013-07-23 17:29:13
80 :-) |
|
abhishek arora:
2013-07-11 18:44:19
beaware a1 a2 a3 all are distinct...
|
|
test :
2013-06-12 22:12:57
There isn't any special test case. Hint:check if your program works if any one of a1 a2 or a3 is zero. Silly mistake! |
|
Edwin:
2013-06-10 04:24:06
Why always WA? Anyone know testcase? |
|
Avi:
2013-04-07 01:19:40
1 , 0 , 0 |
|
Divya Gupta:
2013-03-20 17:22:18
such a time waste |
|
driller:
2013-03-17 12:50:36
its giving wa pplease tell any special case if any
|
|
olf:
2013-01-08 19:19:04
getting TLE
|
|
Geronimo De Abreu:
2012-11-12 03:35:48
take care about the stop condition...
|
|
gourav:
2012-10-22 12:45:03
i think world's most easiest problem is here... come on guys !! ;) |
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 |