치춘짱베리굿나이스
200203 백준 본문
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
N = int(input()) | |
I = [int(i) for i in input().split(" ")] | |
min = 1000000 | |
max = -1000000 | |
for i in range(0,N): | |
if min > I[i] : | |
min = I[i] | |
if max < I[i] : | |
max = I[i] | |
print(min, max) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
max = -100000 | |
n = 0 | |
for i in range(0, 9): | |
I = int(input()) | |
if max < I : | |
max = I | |
n = i | |
print(max) | |
print(n+1) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
I = 1 | |
cnt = 0 | |
for i in range(0, 3): | |
I = I*int(input()) | |
for j in range(0, 10): | |
for o in str(I): | |
if o == str(j): | |
cnt = cnt + 1 | |
print(cnt) | |
cnt = 0 |
20년 02월 03일에 푼 백준
'Python > 알고리즘풀이' 카테고리의 다른 글
[백준] 27434 (0) | 2023.07.19 |
---|---|
200720 알고스팟 문제 (0) | 2021.02.08 |
200204 백준 (0) | 2021.02.08 |
Comments