CT24124

Trader and the Ivory lanterns

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Trader runs the depot at the fen lights of Will-o-Wisp. Today the books show a list of lanterns, and the numbers must be worked out before sundown. Task: Read n integers and print the sum of their squares. Input format: First line: n. Second line: n space-separated integers. Output format: Print the sum of squares. Constraints: 1 <= n <= 853; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 247 10 2 7 4 6 1 8 1 10 2 1 6 4 2 4 4 0 8 9 7 9 1 3 8 4 0 0 10 3 2 5 8 3 7 9 0 0 7 6 3 9 8 5 9 10 8 7 0 1 1 8 0 4 1 5 4 9 6 0 8 8 10 10 8 2 3 0 10 8 7 0 6 2 9 10 1 6 7 0 3 0 0 5 4 2 8 3 10 8 3 9 9 6 7 8 7 0 10 0 10 7 0 4 1 2 2 8 4 0 7 1 4 0 4 0 5 1 4 2 6 8 9 8 10 4 6 6 8 10 5 3 3 5 2 3 4 6 0 5 4 10 0 9 8 0 10 6 8 9 7 5 6 8 2 1 0 0 0 6 2 8 5 10 7 3 6 9 2 4 0 0 1 5 10 5 7 8 10 7 6 6 8 8 9 7 5 4 2 3 9 7 1 6 4 1 10 4 10 0 1 2 1 2 5 9 4 4 7 1 2 3 7 10 7 1 6 3 2 1 8 10 2 6 4 4 8 4 6 2 6 3 4 3 2 3 8 10 9 6 2 3 5 8 1 4 3 10
Output: 8541

Example 2:

Input: 663 0 10 2 2 0 5 1 8 1 2 5 5 4 8 7 0 8 5 0 0 9 4 6 5 10 4 9 5 7 1 6 1 10 6 2 5 10 6 1 1 2 2 7 8 3 3 6 7 2 8 4 0 4 1 7 3 5 4 3 0 7 4 6 1 7 3 8 5 5 4 4 8 5 1 3 3 10 9 8 10 4 3 2 1 0 7 5 0 5 6 3 6 2 0 3 2 1 9 6 3 3 7 1 4 2 8 0 5 8 10 0 2 5 1 3 4 10 7 3 4 2 7 3 1 0 6 6 4 8 3 9 2 9 4 7 9 5 5 1 4 6 2 10 0 2 1 2 7 4 0 10 9 1 6 8 7 5 9 7 1 2 8 8 2 8 4 4 2 8 2 9 5 8 10 9 5 9 9 6 7 10 5 5 10 3 4 8 2 8 3 5 2 0 8 8 4 0 5 4 2 10 7 7 8 9 4 10 7 4 2 1 4 8 7 4 2 0 1 2 1 7 7 2 6 10 10 1 8 6 5 7 9 0 9 8 0 4 0 0 4 1 10 5 7 3 1 0 5 9 6 0 8 1 1 0 10 4 3 7 10 6 3 7 4 4 1 2 4 2 8 5 2 6 7 5 5 3 9 2 9 4 3 10 3 5 10 0 1 10 8 5 3 0 10 9 5 7 1 10 9 10 9 10 3 9 5 9 8 3 8 7 1 10 3 5 10 3 2 6 9 10 10 10 6 1 9 10 10 0 6 5 4 4 10 6 6 5 10 6 1 5 9 10 7 0 8 4 6 1 8 10 0 10 0 1 7 3 4 5 5 4 0 1 6 9 8 2 8 9 5 2 1 0 2 1 9 4 2 1…
Output: 22594

Example 3:

Input: 738 7 3 6 1 9 5 4 1 2 10 6 0 6 2 0 8 10 5 7 3 6 5 8 5 8 8 3 4 3 7 3 6 0 9 7 10 6 1 7 4 0 4 3 6 5 2 6 3 9 6 5 4 10 6 6 6 1 5 9 9 2 5 3 5 1 3 0 3 3 0 0 1 10 2 3 2 10 3 4 2 9 7 8 8 8 2 9 8 5 3 9 3 6 10 2 0 4 3 3 7 0 4 2 4 2 2 10 5 5 10 6 10 4 2 1 10 2 9 3 10 4 10 3 2 1 0 9 3 7 7 3 4 8 8 7 9 6 4 4 6 0 4 2 9 6 8 6 6 10 6 8 10 10 3 9 2 2 3 0 7 7 2 0 4 1 3 4 9 4 2 5 4 1 1 9 6 6 2 1 7 0 4 6 6 2 1 2 0 5 1 2 5 6 5 8 1 9 3 6 8 9 5 2 4 8 5 1 7 0 1 9 0 2 3 9 7 3 0 8 3 8 0 8 6 10 3 3 6 6 0 8 7 0 1 3 0 9 5 3 2 4 2 7 10 9 7 7 0 0 10 10 1 0 10 4 1 6 5 2 5 8 4 0 8 0 4 4 6 8 9 9 5 2 1 6 0 3 5 4 2 9 7 8 2 1 3 10 7 10 6 1 0 3 9 2 0 3 6 4 10 2 6 5 5 5 4 5 2 5 0 2 3 10 5 9 3 2 10 4 6 4 5 5 9 8 3 5 4 6 0 9 5 8 0 7 0 10 2 4 3 3 1 10 7 8 4 0 10 6 10 10 9 4 9 2 4 4 5 0 0 0 0 4 1 2 1 2 9 7 7 10 9 3 5 8 7 0 7 3 4 6 6 …
Output: 25571

Constraints:

1 <= n <= 853; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Loading...
Test Cases:No test cases
No test cases available.