英语翻译15

https://acs.jxnu.edu.cn/problem/ICPCJX2020D

描述：

Recently, God Liu has been so absorbed in the Pac-Man game that he has even neglected his young fans.So before Chinese valentine's day，in order to have time for him to accompany the girls, while God Liu went to the bathroom, Lao Zhao hid his computer, and told him that computer had been hidden near the date place.But Lao Zhao can't tell him where the computer has been hidden.

Lao Zhao tell God Liu N numbers, the answer is the sum of all the numbers that have appeared in n numbers(mod 9982443553).For example, in 123 there are 1,2,3,12,23,123。

Gao Liu are so excited,he decides to pick up the computer after the date night.But he is too busy,sou he ask you to help him。Do you know the answer?

输入：

In the first line there is an positive integer N(1<=N<=1000)N(1<=N<=1000),which means there are NN numbers.

The next NN line,each line is contains one number.

The digit sum of all numbers does not exceed 10000001000000.

输出：

One integer after mod 99824435539982443553.(An occurrence in a number is defined as the number of substrings, and repeated occurrences are counted only once)

样例输入：

3
1
12
123

样例输出：

164

Of all the numbers that have ever appeared 1,2,3,12,23,123,sothe sum is 164.

题目大意：

最近，刘老爷全神贯注于百人游戏，甚至忽略了他的年轻粉丝，所以在中国情人节之前，为了有时间陪女儿们，老赵藏起了电脑，告诉他电脑藏在约会地点附近，但是老赵不能告诉他电脑藏在哪里了。
老赵告诉上帝刘恩的数字，答案是所有出现n个数字的数字之和(Mod 9982443553)，例如123号有1，2，3，12，23,123。
高刘太兴奋了，他决定在约会后拿起电脑，但是他太笨了，所以他要求你帮他。你知道答案吗？
 

输入：

在第一行中有一个正整数N(1<=N<=1000)N(1<=N<=1000)，这意味着有NN数。
下一条NN线，每一行包含一个数字。
所有数字的数字和不超过10000001000000。
 

输出：

在mod 99824435539982443553之后的一个整数。(一个数字中的一个事件被定义为子串的编号，重复出现的次数只计算一次)
 

样例输入：

3
1
12
123

样例输出：

164