PivotOJ

Interview Question

시간 제한: 1000ms메모리 제한: 1024MB출처: NWERC 2022BOJ 26182

문제

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 aa and bb, and the game consists of counting up through the positive integers, replacing any number by Fizz if it is a multiple of aa, by Buzz if it is a multiple of bb, and by FizzBuzz if it is a multiple of both aa and bb. The most common form of the game has a=3a=3 and b=5b=5, 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 aa and bb that could have been used to generate it.

Figure I.1 shows some sample sequences for various values of aa and bb.

a=3,b=5:a=3, b=5: 1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz
a=6,b=2:a=6, b=2: 1 Buzz 3 Buzz 5 FizzBuzz 7 Buzz 9 Buzz 11 FizzBuzz 13
a=4,b=4:a=4, b=4: 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 cc and dd (1cd1051 \le c \le d \le 10^5), indicating that your transcript starts at cc and ends at dd.
  • One line with dc+1d-c+1 integers and strings, the contents of the transcript.

It is guaranteed that the transcript is valid for some integers aa and bb with 1a,b1061 \le a,b \le 10^6, according to the rules laid out above.

출력

Output two positive integers aa and bb (1a,b1061 \le a,b \le 10^6) 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
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.