Submit | All submissions | Best solutions | Back to list |
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
|
||||||||||||||
2015-08-29 06:42:35
for the people who are getting WA the input should terminate if you enter 0 0 0 until then we need to get input , and output has to be only integer. |
||||||||||||||
2015-07-21 13:53:32 avidcoder
I wonder why only one logic gets Ac whereas other logics are WA. Why?? for a,b,c AP-> 2*c-a gets AC. but c+(b-a) WA. for a,b,c GP-> k*(k/j) gets AC. but k*(j/i) WA. I hate this problem |
||||||||||||||
2015-07-15 21:26:23
> varun kumar: 2014-11-05 14:54:19 > its accepting c+(c-b) but not c+(b-a) > and c*(c/b) but not c*(b/a) The same in PHP Last edit: 2015-07-15 21:26:41 |
||||||||||||||
2015-06-03 12:08:45 ADITYA SINGH
for those using the condition b==(a+c)/2, try a=1, b=2, c=4. |
||||||||||||||
2015-05-31 09:18:23
2b=a+c and b*b=a+c and ("AP<space>%ld\n",output); are correct formats in c code :) finally got ac:) |
||||||||||||||
2015-05-30 09:56:33
Got an AC by entering 2*b=a+c instead of b=(a+c)/2. But dont know why? Please help. |
||||||||||||||
2015-05-21 21:24:20 Bhuvnesh Jain
finally got AC ;-) Last edit: 2015-05-25 00:49:14 |
||||||||||||||
2015-05-12 22:40:46
When writing in java i get run-time error(NZEC), why is that ? |
||||||||||||||
2015-05-12 10:24:42 prodigy_coder
why am I getting WA even when my outputs are showing correct? Is there some trick here that I don't understand? |
||||||||||||||
2015-03-15 19:21:00 munjal
how many total number of inputs can you give ??? |