英语翻译04

2022 01.20第四天

Chinese Valentine's Day

Chinese Valentine's Day | JXNUOJ

中国情人节

 1000ms  262144K

描述：

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。

老赵告诉上帝刘N个数字，答案是N个数字（mod 9982443553）中出现的所有数字的总和。例如，在123中有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 N numbers.

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

The digit sum of all numbers does not exceed 10000001000000.

在第一行中有一个正整数N（1<=N<=1000）N（1<=N<=1000），这意味着有N个数字。

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

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

输出：

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

mod 998244355399824443553后的一个整数。（数字中的出现次数定义为子字符串的数量，重复出现的次数仅统计一次）

样例输入：

3
1
12
123

样例输出：

164

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