Preparing NOJ

Creating Multiples

0ms 0K

Description:

Malba is a very smart kid who loves to perform calculations. He has won several competitions, including the prestigious Tahan competition, in which he got the first prize, representing his country, Logonia.

He created a puzzle, in which he considers a number $$$N$$$, written in a certain base $$$B$$$, and represented by $$$L$$$ digits. The objective of the game is to reduce at most one of the digits so that the new number, $$$M$$$, be a multiple of the number $$$B+1$$$. But there is a catch: among the possible solutions you must choose one that renders $$$M$$$ the smallest possible value.

For example, suppose that $$$B=10$$$ and $$$N=23456$$$. There are two ways in which $$$M$$$ may be obtained: either we reduce the digit 4 to 0 or we reduce the digit 6 to 2. Thus, 4 must be changed to 0, hence $$$M=23056$$$. Sometimes there is no solution, as is the case if $$$B=10$$$ and $$$N=102$$$. In this case, if we change the digit 1 to 9 we get a multiple of 11, but we are not allowed to increase the value of a digit!

Observe that it may be necessary to reduce the first digit to 0. For example, this is the case if $$$B=10$$$ and $$$N=322$$$.

Can you tell which digit should be reduced and what is its new value?

Input:

The first line contains two integers $$$B$$$ and $$$L$$$ ($$$2 \leq B \le 10^4$$$, $$$1 \le L \le 2 \times 10^5$$$), representing the base and the number of digits of the number $$$N$$$, respectively.

The second line contains $$$L$$$ integers $$$D_1, D_2, \dots, D_L$$$ ($$$0 \le D_i < B$$$ for $$$i=1, 2, \dots, L$$$), representing the digits of the number $$$N$$$. The first digit, $$$D_1$$$, is the most significant and the last, $$$D_L$$$, is the least significant.

Output:

Output a line containing two integers, separated by one space. The first integer is the index of the digit to be changed (recall that the index of the first digit, $$$D_1$$$, is 1 and the index of the last digit, $$$D_L$$$, is $$$L$$$). The second integer is the new value of the digit. If there is no solution to the problem, output -1 -1. If $$$N$$$ is already a multiple of $$$B+1$$$ then output 0 0.

Sample Input:

10 5
2 3 4 5 6

Sample Output:

3 0

Sample Input:

10 3
1 0 2

Sample Output:

-1 -1

Sample Input:

2 5
1 0 1 1 1

Sample Output:

4 0

Sample Input:

17 5
3 0 0 0 0

Sample Output:

1 0

Sample Input:

16 4
15 0 13 10

Sample Output:

1 14

Sample Input:

16 5
1 15 0 13 10

Sample Output:

0 0

Info

CodeForces Gym

Provider CodeForces Gym

Origin 2021-2022 ACM-ICPC Brazil Subregional Programming Contest

Code GYM103388C

Tags

Submitted 0

Passed 0

AC Rate 0%

Date 11/01/2021 22:23:26

Related

Nothing Yet