In this problem, you are given several strings that contain only digits from '0' to '9', inclusive.

An example is shown below.

101

123

The set S of strings is consists of the N strings given in the input file, and all the possible substrings of each one of them.

It's boring to manipulate strings, so you decide to convert strings in S into integers.

You can convert a string that contains only digits into a decimal integer, for example, you can convert "101" into 101, "01" into 1, et al.

If an integer occurs multiple times, you only keep one of them.

For example, in the example shown above, all the integers are 1, 10, 101, 2, 3, 12, 23, 123.

Your task is to calculate the remainder of the sum of all the integers you get divided by 2012.

An example is shown below.

101

123

The set S of strings is consists of the N strings given in the input file, and all the possible substrings of each one of them.

It's boring to manipulate strings, so you decide to convert strings in S into integers.

You can convert a string that contains only digits into a decimal integer, for example, you can convert "101" into 101, "01" into 1, et al.

If an integer occurs multiple times, you only keep one of them.

For example, in the example shown above, all the integers are 1, 10, 101, 2, 3, 12, 23, 123.

Your task is to calculate the remainder of the sum of all the integers you get divided by 2012.

提交代码