-
[B1181][단어 정렬][python]
2021.03.10
n = int(input()) arr = [input() for _ in range(n)] arr_idx = [len(arr[i]) for i in range(n)] max_idx = max(arr_idx) + 1 ans = [] cnt = 1 while cnt != max_idx: L = [] for i in arr: if len(i) == cnt: L.append(i) if len(L) == 1: ans.append(L[0]) else: L.sort() for l in L: ans.append(l) cnt += 1 ans1 = [] for v in ans: if v not in ans1: ans1.append(v) for a in ans1: print(a)
-
[B3052][나머지][python]
2021.03.10
arr = [int(input()) % 42 for _ in range(10)] n = [] for i in range(len(arr)): if arr[i] not in n: n.append(arr[i]) print(len(n))
-
[B2908][상수][python]
2021.03.10
n, m = map(str, input().split()) n, m = int(n[::-1]), int(m[::-1]) # 문자열 reverse print(max(m, n))
-
-
[B2475][검증수][python]
2021.03.10
arr = list(map(int, input().split())) add = [pow(i,2) for i in arr] print(sum(add) % 10)
-
[B3040][백설공주와 일곱 난쟁이][C++]
2021.03.09
#include using namespace std; int main() { int arr[9], sum = 0; for (int i = 0; i > arr[i]; sum += arr[i]; } for (int i = 0; i < 8; i++) { for (int j = i + 1; j < 9; j++) { if (sum - arr[i] - arr[j] == 100) { for (int r = 0; r < 9; r++) { if (r != i && r != j) cout
-
[B1037][약수][python]
2021.03.09
n = int(input()) L = [1] L += list(map(int, input().split())) L.sort() if (len(L)+1)%2 == 0: idx = (len(L)+1)//2 print(L[idx - 1] * L[idx]) else: idx = (len(L)+1)//2 + 1 print(L[idx - 1] * L[idx - 1])
-
[B1041][주사위][C++]
2021.03.09
#include #include using namespace std; int main() { int arr[6]; long long n, up = 0, down = 0; cin >> n; for (int i = 0; i > arr[i]; if (n == 1) { sort(arr, arr + 6); for (int i = 0; i < 5; i++) up += arr[i]; cout
-
[B9095][1,2,3 더하기][C++]
2021.03.09
#include using namespace std; int main() { int cnt, n; int arr[11]; cin >> cnt; arr[1] = 1, arr[2] = 2, arr[3] = 4; for (int i = 0; i > n; for (int j = 4; j
-
[B17204][죽음의 게임][C++]
2021.03.09
#include using namespace std; int main() { int n, m; cin >> n >> m; int *point = new int[n]; for (int i = 0; i > point[i]; int cnt = 0, tmp = 0; while (1) { tmp = point[tmp]; cnt++; if (tmp == m) break; else if (cnt > n) break; } if (tmp == m) cout
-
[B8958][OX 퀴즈][C++]
2021.03.09
#include #include using namespace std; int main() { int n, score, sum; char OX[80]; cin >> n; for (int i = 0; i > OX; for (int j = 0; j < strlen(OX); j++) { if (OX[j] == 'O'){ sum += score; score++; } if (OX[j] == 'X') score = 1; } cout
-
[B1010][다리 놓기][python]
2021.03.09
import math t=int(input()) arr=[] for i in range(t): n,m=input().split() n,m=int(n),int(m) answer=math.factorial(m)//math.factorial(n)//math.factorial(m-n) print(answer)
-
[B1009][분산처리][python]
2021.03.05
import sys data_cnt = int(sys.stdin.readline()) for _ in range(data_cnt): a, b = map(int, sys.stdin.readline().split()) result = [(a ** i) % 10 for i in range(1,5)][(b % 4) -1] print(result if result != 0 else 10)
-
[B11943][파일 옮기기][python]
2021.03.05
n1, m1 = map(int, input().split()) n2, m2 = map(int, input().split()) print(min(n1 + m2, n2 + m1))
-
[B2588][곱셈][python]
2021.03.05
n = int(input()) m = int(input()) m1 = m // 100 m2 = (m // 10) % 10 m3 = m % 10 print(n * m3, n * m2, n * m1, (n * m3) + (n * m2 * 10) + (n * m1 * 100))
-
[B2530][인공지능 시계][python]
2021.03.05
a,b,c = map(int, input().split()) x = int(input()) a += (x // 60) // 60 b += (x // 60) % 60 c += x % 60 if c >= 60: c %= 60 b += 1 if b >= 60: b %= 60 a += 1 if a >= 24: a %= 24 print(a,b,c)
-
[B2525][오븐 시계][python]
2021.03.05
h, m = map(int, input().split()) x = int(input()) h += x // 60 m += x % 60 if m >= 60: m %= 60 h += 1 if h >= 24: h %= 24 print(h, m)
-
[B2480][주사위 세개][python]
2021.03.05
a, b, c = map(int, input().split()) if a == b == c: print(10000 + 1000 * a) elif a == b: print(1000 + 100 * a) elif b == c: print(1000 + 100 * b) elif a == c: print(1000 + 100 * c) else: print(100 * max(a,b,c))
-
-
[B1712][손익분기점][C++]
2021.03.05
#include using namespace std; int main() { int a, b, c; int num = 1; cin >> a >> b >> c; if (c > b) cout
