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
|
/* Nitin Jaiman */:
2014-08-13 20:52:28
Something is wrong in this problem i was getting wrong answer in java and when i implemented same come in c++ i got AC. |
|
ravi:
2014-08-07 21:52:16
GOT AC in 2nd go....
|
|
wake up sid !!!!:
2014-07-21 13:51:52
endl costed me a mistake !!!
|
|
Steven Hans Limantoro:
2014-06-30 19:56:56
easy one..just got one WA because of a simple mistake |
|
Deepak Singh Tomar:
2014-06-29 17:19:02
got accepted after 5 WA's..did some really silly mistakes |
|
opcode:
2014-06-21 14:14:53
easy one |
|
Shireen Nagdive:
2014-06-19 13:25:47
AC in first go :D
|
|
Surendra:
2014-06-15 09:00:50
@Abhishek the code is correct but just change positions of \n it should be used only after the %d in both AP and GP blocks. remove the \n before GP and place one after %d in AP. And bingo. |
|
Abhishek Kumar:
2014-06-10 15:52:36
plz plz somebody check my solution..my sol is sworking correctly but spoj giving wrong ans..plz somebody help i m new at spoj...
|
|
rocode:
2014-06-06 08:53:07
AC in the first try . :D |
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 |