Codeforces 1202 B.You Are Given a Decimal String

题目描述：

 

Suppose you have a special x-y-counter. This counter can store some value as a decimal number; at first, the counter has value 00.

The counter performs the following algorithm: it prints its lowest digit and, after that, adds either x or y to its value. So all sequences this counter generates are starting from 00. For example, a 4-2-counter can act as follows:

1. it prints 0, and adds 4 to its value, so the current value is 4, and the output is 0;
2. it prints 4, and adds 4 to its value, so the current value is 8, and the output is 04;
3. it prints 8, and adds 4 to its value, so the current value is 12, and the output is 048;
4. it prints 2, and adds 2 to its value, so the current value is 14, and the output is 0482;
5. it prints 4, and adds 4 to its value, so the current value is 18, and the output is 04824.

This is only one of the possible outputs; for example, the same counter could generate 0246802468024 as the output, if we chose to add 2 during each step.

You wrote down a printed sequence from one of such x-y-counters. But the sequence was corrupted and several elements from the sequence could be erased.

Now you'd like to recover data you've lost, but you don't even know the type of the counter you used. You have a decimal string ss — the remaining data of the sequence.

For all 0≤x,y<10, calculate the minimum number of digits you have to insert in the string s to make it a possible output of the x-y-counter. Note that you can't change the order of digits in string s or erase any of them; only insertions are allowed.

Input

The first line contains a single string ss (1≤|s|≤2⋅106, si∈{0−9}) — the remaining data you have. It's guaranteed that s1=0.

Output

Print a 10×10 matrix, where the jj-th integer (0-indexed) on the ii-th line 00-indexed too) is equal to the minimum number of digits you have to insert in the string ss to make it a possible output of the i-j-counter, or −1 if there is no way to do so.

Example

input

0840

output

-1 17 7 7 7 -1 2 17 2 7 
17 17 7 5 5 5 2 7 2 7 
7 7 7 4 3 7 1 7 2 5 
7 5 4 7 3 3 2 5 2 3 
7 5 3 3 7 7 1 7 2 7 
-1 5 7 3 7 -1 2 9 2 7 
2 2 1 2 1 2 2 2 0 1 
17 7 7 5 7 9 2 17 2 3 
2 2 2 2 2 2 0 2 2 2 
7 7 5 3 7 7 1 3 2 7 

Note

Let's take, for example, 4-3-counter. One of the possible outcomes the counter could print is 0(4)8(1)4(7)0 (lost elements are in the brackets).

One of the possible outcomes a 2-3-counter could print is 0(35)8(1)4(7)0.

The 6-8-counter could print exactly the string 0840.

题目大意：给你一串数字，然你检验这串数字是否可能被x-y的打印机器打印出来，可以在x-y删除打印出的数字，如果可以打印，输出需要删除数字的个数。

题目思路：此题可以转化为求任意两点最短路的问题，具体处理可以看代码

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
int dis[10][10];
char s[2000005];
int n;
int calc(int x,int y){
    memset(dis,0x3f,sizeof(dis));//数组初始化
    for(int i=0;i<=9;i++)
        dis[i][(i+x)%10]=dis[i][(i+y)%10]=1;//x-y打印相邻的两个数字间距离为1，且x-y与y-x是相同的
    for(int k=0;k<=9;k++)
        for(int i=0;i<=9;i++)
            for(int j=0;j<=9;j++)
            dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);//Floyd求任意两个点间最短距离
    long long  ans=0;
	for(int i=0;i<n-1;i++){
		int cur=dis[s[i]-'0'][s[i+1]-'0'];
		if (cur>=inf) return -1;
		ans+=cur-1;
	}
	return ans;
}
int main(){
    scanf("%s", s);
    getchar();
    n=strlen(s);
    for(int i=0;i<=9;i++){
        for(int j=0;j<=9;j++)
            cout<<calc(i,j)<<' ';
        cout<<endl;
    }
}