ICPCJX2020D Chinese Valentine‘s Day 翻译

描述：

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),which means there are N numbers.

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

The digit sum of all numbers does not exceed 1000000.

输出：

One integer after mod 9982443553.(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.

原题链接：Chinese Valentine's Day | JXNUOJ

描述：

最近，刘神十分沉浸在吃豆人游戏中，甚至忽视了自己的年轻粉丝。因此在七夕节之前，为了让他有时间去陪伴女孩们，当刘神去浴室的时候，老赵把他的电脑藏了起来，并告诉他电脑被藏在约会地点附近。但是老赵不能告诉他电脑藏在哪里。

老赵告诉刘神N个数字，答案就是所有的数字在n个数字里出现的总和（模式 9982443553）。例如，在123中有1,2,3,12,23,123。

刘神非常兴奋，他打算在约会夜之后拿回电脑。但是他太忙了，他要你帮他。你知道答案吗？

输入：

在第一行有一个正整数N(1<=N<=1000)，意味着有N个数字。

接下来的N行，每一行包含一个数字。

所有数字之和的数位不能超过1000000。

输出：

一个通过模式9982443553之后的整数。（数字中的出现次数定义为子字符串的数量，重复出现的次数只计算一次）

样例输出：

164

在所有数字中出现了1,2,3,12,23,123,所以总和为164。