英语题目作业（4）

原题：

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)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)

（链接：https://acs.jxnu.edu.cn/problem/ICPCJX2020D）

翻译：

中国的情人节

最近God Liu沉迷于Pac-Man游戏，以至于忽略了他的年轻的粉丝。所以在中国的情人节之前，为了让他有时间陪伴这些女孩，Lao Zhao在他去洗手间时，把他的电脑藏起来了，并且告诉他电脑被藏在了约会地点附近。但是Lao Zhao没告诉他电脑被藏在了哪。

Lao Zhao告诉God Liu N个数字，答案是所有出现这N个数字的数的和。

例如，给出数字123有1,2,3,12,23,123.

God Liu很激动，他决定在约会之夜之后找到电脑。但是他太忙了，所以他找你帮忙。你知道答案吗？

输入：

第一行有一个正整数N(1<=N<=1000),代表有N个数字。

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

所有数字之和不超过1000000。

输出：

一个整数（数字之和）。（每个出现的数字是子串的数目，重复出现的只计一次）