Algorithm
-
sum = 0 max = 0 for i in range(10): off, on = map(int, input().split()) sum += on sum -= off if max < sum: max = sum print(max)
[python] 백준 : 지능형 기차 2 (2455번)sum = 0 max = 0 for i in range(10): off, on = map(int, input().split()) sum += on sum -= off if max < sum: max = sum print(max)
2024.02.19 -
#include int main() { int off, on; int sum = 0, max = 0; for (int i = 0; i < 10; i++) { scanf("%d %d", &off, &on); sum += on; sum -= off; if (max < sum) { max = sum; } } printf("%d", max); return 0; }
[C언어] 백준 : 지능형 기차 2 (2455번)#include int main() { int off, on; int sum = 0, max = 0; for (int i = 0; i < 10; i++) { scanf("%d %d", &off, &on); sum += on; sum -= off; if (max < sum) { max = sum; } } printf("%d", max); return 0; }
2024.02.19 -
m = int(input()) ball = 1 for i in range(m): x, y = map(int, input().split()) if x == ball: ball = y elif y == ball: ball = x print(ball)
[python] 백준 : 공 (1547번)m = int(input()) ball = 1 for i in range(m): x, y = map(int, input().split()) if x == ball: ball = y elif y == ball: ball = x print(ball)
2024.02.19 -
#include int main() { int m, x, y; int temp; int ball = 1; scanf("%d", &m); for (int i = 0; i < m; i++) { scanf("%d %d", &x, &y); if (x == ball) { ball = y; } else if (y == ball) { ball = x; } } printf("%d", ball); return 0; }
[C언어] 백준 : 공 (1547번)#include int main() { int m, x, y; int temp; int ball = 1; scanf("%d", &m); for (int i = 0; i < m; i++) { scanf("%d %d", &x, &y); if (x == ball) { ball = y; } else if (y == ball) { ball = x; } } printf("%d", ball); return 0; }
2024.02.19 -
t = int(input()) for i in range(t): total = 0 input() n = int(input()) for j in range(n): candy = int(input()) total += candy if total % n == 0: print("YES") else: print("NO")
[python] 백준 : 사탕 선생 고창영 (2547번)t = int(input()) for i in range(t): total = 0 input() n = int(input()) for j in range(n): candy = int(input()) total += candy if total % n == 0: print("YES") else: print("NO")
2024.02.19 -
#include int main() { int t, n; long long int candy; scanf("%d", &t); for (int i = 0; i < t; i++) { long long int total = 0; scanf("%d", &n); for (int j = 0; j < n; j++) { scanf("%lld", &candy); total += candy; total = total % n; } if (total == 0) { printf("YES\n"); } else { printf("NO\n"); } } return 0; }
[C언어] 백준 : 사탕 선생 고창영 (2547번)#include int main() { int t, n; long long int candy; scanf("%d", &t); for (int i = 0; i < t; i++) { long long int total = 0; scanf("%d", &n); for (int j = 0; j < n; j++) { scanf("%lld", &candy); total += candy; total = total % n; } if (total == 0) { printf("YES\n"); } else { printf("NO\n"); } } return 0; }
2024.02.19 -
import math n, w, h = map(int, input().split()) box = math.sqrt(w * w + h * h) for i in range(n): match = int(input()) if match > box: print("NE") else: print("DA") n, w, h = map(int,input().split()) p = ww + hh for i in range(n): s = int(input()) if s*s > p: print("NE") else: print("DA")
[python] 백준 : 앵그리 창영 (3034번)import math n, w, h = map(int, input().split()) box = math.sqrt(w * w + h * h) for i in range(n): match = int(input()) if match > box: print("NE") else: print("DA") n, w, h = map(int,input().split()) p = ww + hh for i in range(n): s = int(input()) if s*s > p: print("NE") else: print("DA")
2024.02.19 -
#include #include int main() { int n, w, h, match; double box; scanf("%d %d %d", &n, &w, &h); box = sqrt(w * w + h * h); for (int i = 0; i box) { printf("NE\n"); } else { printf("DA\n"); } } return 0; }
[C언어] 백준 : 앵그리 창영 (3034번)#include #include int main() { int n, w, h, match; double box; scanf("%d %d %d", &n, &w, &h); box = sqrt(w * w + h * h); for (int i = 0; i box) { printf("NE\n"); } else { printf("DA\n"); } } return 0; }
2024.02.19