-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1095_array3.py
More file actions
51 lines (31 loc) · 1.12 KB
/
Copy path1095_array3.py
File metadata and controls
51 lines (31 loc) · 1.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
'''
Code Up - Algorithm Basic - 100 Questions
[기초-1차원배열] 1095 Basic Alogrithm question - 1D Array
https://codeup.kr/problem.php?id=1095
Date : 2021-02-17
Solved BY : TK Lee
The information teacher calls odd attendance today.
Youngil tried to think differently today.
I don't think I have all the attendance numbers... What was the fastest number?
When the attendance number is called at random n times, let's print out the earliest number.
Reference
If you write them in order in an array, you can check all the recorded contents to find the smallest value.
By the way, how do you compare and find the smallest value?
input
The number of times the number was called (n, 1 ~ 10000) is entered in the first line.
n random numbers (k, 1 to 23) are entered in order with a space in the second line.
Print
Only one of the numbers that called for attendance is output.
Input example
10
10 4 2 3 6 6 7 9 8 5
Example output
2
'''
l = int(input())
num = [int(i) for i in input().split()]
minNum = num[0]
for n in num:
if(minNum >= n):
minNum = n
print(minNum)