[BAEKJOON] 2884 : 알람 시계 - python3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 H, M = input().split() I = 0 H = int(H) M = int(M) if(H==0): if(M>=45): I = (H*60+M) - 45 print(H, I%60) else: I = (H*60+M) - 45 H = 23 print(H, I%60) else: I = (H*60+M) - 45 print(int(I/60), I%60) cs Study/BAEKJOON 2021.08.04
[BAEKJOON] 14681 : 사분면 고르기 - python3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 x = int(input()) y = int(input()) if(-1000 Study/BAEKJOON 2021.08.04
[BAEKJOON] 9498 : 시험 성적 - python3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 A = int(input()) if (0 = 80: print("B") elif A >= 70: print("C") elif A >= 60: print("D") else: print("F") cs Study/BAEKJOON 2021.08.04
[BAEKJOON] 1330 : 두 수 비교하기 - python3 1 2 3 4 5 6 7 8 9 10 11 12 A,B = input().split() A = int(A) B = int(B) if ( A = 10000 or B = 10000): exit() elif A>B: print(">") elif A Study/BAEKJOON 2021.08.03
[BAEKJOON] 2577 : 숫자의 개수 1234567891011121314151617181920212223#includeint main(){ int arr[10] = { 0 }, abc, rest=0, a,b,c,i; scanf("%d", &a); scanf("%d", &b); scanf("%d", &c); abc = a * b * c; while (abc >0) { rest = abc % 10; abc /= 10; arr[rest]++; } for (i = 0; i Study/BAEKJOON 2020.09.20
[BAEKJOON] 2562 : 최댓값 123456789101112131415#includeint main(){ int arr[9] = { 0 }, i,max=0,num=0 ; for (i = 0; i max) { max = arr[i]; num = i + 1; } } printf("%d\n%d",max,num);}Colored by Color Scriptercs Study/BAEKJOON 2020.09.19
[BAEKJOON] 10818 : 최소, 최대 12345678910111213141516171819#includeint main(){ int min=1000000,max=-1000000,i,n=0,num; scanf("%d", &n); for (i = 0; i Study/BAEKJOON 2020.09.19
[BAEKJOON] 1110 : 더하기 사이클 12345678910111213141516171819202122232425#include int main(){ int i; int result; int A, B, C, D; int count = 0; scanf("%d", &i); result = i; while (1) { A = i / 10; B = i % 10; C = (A + B) % 10; D = (B * 10) + C; i = D; count++; if (D == result) break; } printf("%d", count);}cs Study/BAEKJOON 2020.09.15