英文题面翻译04

英文原题：题目来源：Chinese Valentine's Day | JXNUOJ

Chinese Valentine's Day

 1000ms  262144K

描述：

Recently, Gao 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 Gao 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 Gao 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)

翻译

描述：

最近，高刘沉迷于Pac-Man游戏，甚至忽略了他的女朋友。在中国情人节之前，为了让他有时间陪女朋友，当高刘去洗手间，老赵把他的电脑藏起来了，并告诉他，电脑被藏在约会地点。但老赵不能告诉他电脑被隐藏在哪里。

老赵告诉了高刘n个数字，答案是在n个数字中出现的所有数字的总和（mod 9982443553）。例如，在123中，有1,2,3,12,23,123。

高刘非常激动，他决定在约会的晚上之后拿回电脑。但是他没有时间，于是他请求你帮助他。你知道答案吗？

输入：

第一行输入一个整数N表示有N个数字

随后N行每行输入一个数字

所有数字的和不超过1000000。

输出：

n个数字中出现的所有数字的总和（mod 9982443553）。