描述：

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)

描述：
最近，劉神太專注于吃豆人游戲了，以至于他甚至忽視了他的年輕粉絲。于是在七夕節前，老趙為了有時間陪女生，趁劉神去洗手間時，把自己的電腦藏了起來，并告訴他電腦被藏在約會地點附近。但是老趙不能告訴他電腦藏在哪里。
老趙告訴劉神N個數字，答案是在N個數字中出現過的所有數字的總和(mod 9982443553)。例如，123中有123 12 23123。
高劉非常興奮，他決定約會之夜之后去拿電腦。但是他太忙了，所以他請你幫他。你知道答案嗎?
輸入：
在第一行有一個正整數N(1<=N<=1000)N(1<=N<=1000)，這意味著有NN數。
下一個NN行，每一行包含一個數字。
所有數字的數字和不能超過10000001000000。
輸出：
mod 99824435539982443553后面加一個整數。(數字中的出現被定義為子字符串的數量，重復出現只計算一次)
?

總結

以上是生活随笔為你收集整理的https://acs.jxnu.edu.cn/problem/ICPCJX2020D的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。