1
2
3
4
5
6

n = int(input())
nums = list(map(int, input().split()))
res = float('inf')
for num in nums:
    res = min(res, num)
print(res)

1
2
3
4
5
6
7
8
9

n, k = map(int, input().split())
A = []
B = []
for i in range(1, n+1):
    if i % k == 0:
        A.append(i)
    else:
        B.append(i)
print(f"{sum(A)/len(A):.1f} {sum(B)/len(B):.1f}")

1
2
3
4
5

a = int(input())
day = 1
while a != 1:
    a, day = a//2, day+1
print(day)

1
2
3
4
5
6
7

n = int(input())
num = 0
for i in range(n, 0, -1):
    for _ in range(i, 0, -1):
        num += 1
        print(f"{num:02d}", end="")
    print("")

1
2
3
4
5
6
7
8

n = int(input())
res = 0
for i in range(n, 0, -1):
    tmp = 1
    for j in range(i, 0, -1):
        tmp *= j 
    res += tmp 
print(res)

1
2
3
4
5
6

n, x = input().split()
n = int(n)
lst = []
for i in range(1, n+1):
    lst.extend(list(str(i)))
print(lst.count(x))

1
2
3
4
5
6

res = 0
i, k = 0, int(input())
while res <= k:
    i += 1
    res += 1/i
print(i)

1
2
3
4
5
6

k = int(input())
res, x = 0, 1
while k > 0:
    res += min(k,x)*x
    k, x = max(0,k-x), x+1
print(res)

1
2
3
4
5

n = int(input())
res = 0
for i in range(1, n+1):
    res += i 
print(res)

 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

import math

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, math.floor(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True

l = int(input())

num, cnt = 1, 0

while l > 0:
    num += 1
    if is_prime(num):
        if l - num >= 0:
            l -= num
            cnt += 1
            print(num)
        else:
            break

print(cnt)

1
2
3
4
5
6
7
8

dist = float(input())
step = 0
swim = 2.0
while dist > 0:
    step += 1
    dist -= swim 
    swim *= 0.98
print(step)

1
2
3
4
5
6

line = input()
negtive = line[0] == '-'
if negtive:
    print(f"-{int(line[:0:-1])}")
else:
    print(f"{int(line[::-1])}")

1
2
3

input()
nums = list(map(int, input().split()))
print(max(nums)-min(nums))

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

n = int(input())
nums = list(map(int, input().split()))
cur_len = 1
max_len = 1
for i in range(1, n):
    if nums[i] == nums[i-1] + 1:
        cur_len += 1
        max_len = max(max_len, cur_len)
    else:
        cur_len = 1
print(max_len)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20

n = int(input())

for i in range(0, n):
    for j in range (0, n):
        print(f"{i*n+j+1:02d}",end="")
    print("")

print("")

cnt = 0
for i in range(0,n):
    for j in range(0,n):
        bar = n-i-1
        if j < bar:
            print(" ", end=" ")
        else:
            cnt += 1
            print(f"{cnt:02d}", end="")
    print("")
    

1
2
3

n = int(input())
arr = list(map(int, input().split()))
print(f"{(sum(arr)-max(arr)-min(arr))/(n-2):.2f}")