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.
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.
For each test case, you program must print a single line of the form:
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.
4 7 10
2 6 18
0 0 0
a,b,c mus be distinct,read the problem :) So,1,1,1 obviously not in the test case .
can anybody give me some corner cases?
Why 1 1 1 should be AP while clearly above it stated that difference should be a non zero integer, anyway i guess its not in test case.. :)Last edit: 2016-09-29 09:04:57
enjoy :)Last edit: 2016-09-25 20:07:33
common ratio should be integer
1 1 1 can never be case because all three numbers should be distinct.
I haven't seen such a stupid question on spoj til date...
note 1 1 1 can be both ap and gp
Take care of the size of those numbers, you'll probably run out of time if your code is greedy enough. GL
Unable to understand the issue.. checked test cases still wrong answer.