Interview Question
문제
Fizz Buzz is a party game that is often used as a programming exercise in job interviews. In the game, there are two positive integers and , and the game consists of counting up through the positive integers, replacing any number by Fizz if it is a multiple of , by Buzz if it is a multiple of , and by FizzBuzz if it is a multiple of both and . The most common form of the game has and , but other parameters are allowed.
Your task here is to solve the reverse problem: given a transcript of part of the game (not necessarily starting at 1), find possible values of and that could have been used to generate it.
Figure I.1 shows some sample sequences for various values of and .
1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz |
|
1 Buzz 3 Buzz 5 FizzBuzz 7 Buzz 9 Buzz 11 FizzBuzz 13 |
|
1 2 3 FizzBuzz 5 6 7 FizzBuzz 9 10 11 FizzBuzz 13 14 |
Figure I.1: Example sequences for Fizz Buzz.
입력
The input consists of:
- One line with two integers and (), indicating that your transcript starts at and ends at .
- One line with integers and strings, the contents of the transcript.
It is guaranteed that the transcript is valid for some integers and with , according to the rules laid out above.
출력
Output two positive integers and () that are consistent with the given transcript.
If there are multiple valid solutions, you may output any one of them.
예제
예제 1
7 11 7 8 Fizz Buzz 11
3 5
예제 2
49999 50002 49999 FizzBuzz 50001 Fizz
2 125
예제 3
8 11 Buzz Buzz FizzBuzz Buzz
10 1
예제 4
10 15 10 11 12 13 14 15
8 23