레이팅 미적용\(3^{rd}\) round, November \(28^{th}\) 2015
The teacher has sent an e-mail to her students with the following task:
"Write a programme that will determine and output the value of \(X\) if given the statement:
\(X = nu\)mber{pot}
1
+ number{pot}
2
+ ... + number{pot}
\(N\)
and it holds that number_{1}, number_{2} to number_{N} are integers, and pot_{1}, pot_{2} to pot_{N} one-digit inte-
gers." Unfortunately, when the teacher downloaded the task to her computer, the text formatting was
lost so the task transformed into a sum of \(N\) integers:
\(X = P\)1 + P2 + ... + \(P_{N}\)
For example, without text formatting, the original task in the form of \(X = 21^{2} +125^{3}\) became a task in
the form of \(X = 212 + 1253\). Help the teacher by writing a programme that will, for given \(N\) integers
from P1 to \(P_{N}\) determine and output the value of \(X\) from the original task.
Please note: We know that it holds \(a\)^{N} = \(a \cdot a\) · ... · \(a\) (\(N\) times).
The first line of input contains the integer \(N\) (1 ⩽\(N\) ⩽10), the number of the addends from the task.
Each of the following \(N\) lines contains the integer \(P_{i}\) (10 ⩽\(P_{i}\) ⩽9999, \(i = 1\) ... N) from the task.
The first and only line of output must contain the value of \(X\) (\(X\) ⩽1 000 000 000) from the original
task.
2
212
1253
5
23
17
43
52
22
3
213
102
45output
output
1953566
102
10385Clarification of the first example: 212 + 1253 = 441 + 1953125 = 1953566.