CT1033

Tina Counts the ingots

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the lakeside town of Mirrormere. Tina spreads the ingots records across the table and picks up a sharp pencil. Task: Read n integers and print the smallest value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the minimum value. Constraints: 1 <= n <= 92; -1000000 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 67 -878840 -179493 -481470 -93308 -275851 -401981 -24152 -908310 -108242 -571780 -926621 -146188 -99096 -170667 -593687 -656381 -225773 -520788 -611283 -256830 -68550 -79542 -622283 -257077 -646224 -149417 -391166 -949365 -901936 -327976 -782583 -107819 -124911 -334934 -850390 -152174 -895158 -826210 -190501 -505777 -151193 -148686 -685607 -654874 -411139 -961382 -116221 -667030 -762812 -465569 -688355 -112340 -111118 -148379 -810923 -400002 -229981 -631092 -732106 -103792 -493525 -197590 -536029 -308732 -754115 -245094 -969222
Output: -969222

Example 2:

Input: 26 -839554 -749136 -795434 -889025 -815356 -711555 -902888 -960748 -164074 -415802 -547115 -34296 -85623 -92234 -837446 -746621 -394164 -309078 -236058 -694379 -524476 -765619 -527193 -846702 -469896 -921861
Output: -960748

Example 3:

Input: 64 -847139 -550370 -910880 -527589 -664944 -433789 -124914 -345977 -705421 -561212 -866625 -663589 -123234 -384721 -623450 -102550 -260918 -255713 -455993 -460846 -860136 -54053 -448877 -420451 -485549 -946468 -856124 -272204 -171579 -162572 -8211 -567583 -698590 -817986 -983434 -483014 -982362 -907403 -798004 -568439 -343912 -306232 -336183 -158781 -133565 -442791 -547628 -384983 -58519 -107697 -666151 -948459 -464879 -132975 -31353 -444373 -969359 -920639 -305526 -416298 -256187 -73699 -600185 -941111
Output: -983434

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Tina Counts the ingots - EASY Coding Problem | CodeTikki