SEM 2 - W2 |
Start: Mar.14.2023 at 12:01:33 AM
Finish: Mar.20.2023 at 08:01:33 PM
The contest is finished!
• Contest scoreboard
|
Feedback | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. bfs.
The sum of two arrays
You will be first given one number (n) which is followed by two series of integers (n space-separated values). Calculate the sum of two series and show them.
Input specification You will be given one integers (n) in the first line, and 1 ≤ n ≤ 10.000. The following two lines contain a two series of integer numbers a[n] and b[n] where -1000 ≤ a[n], b[n] ≤ 1000. Output specification You will give one serie, which is the sum serie of two input series.
Sample Input I 5 3 6 9 5 4 2 5 6 2 7 |
Sample Input II 7 5 8 4 -9 3 2 -6 9 -5 8 2 5
|
Sample Output I 5 11 15 7 11 |
Sample Output II 14 3 12 -7 8 2 -6
|
Для отправки решений необходимо выполнить вход.
|