@kimjuha19

arr = [1, 1, 0, 1, 1, 1, 0, 1] max_cnt = 0 cnt = 1 for i in range(len(arr) - 1): if arr[i] == 1 and arr[i + 1] == 1: cnt += 1 else: cnt = 1

arr = [1, 1, 0, 1, 1, 1, 0, 1] max_cnt = 0 cnt = 1 for i in range(len(arr) - 1): if arr[i] == 1 and arr[i + 1] == 1: cnt += 1 else: cnt = 1

a = 123 rev = int(str(a)[::-1]) answer = a + rev print(answer)

n = 12 count = 0 for i in range(1, n + 1): if (n % i == 0) : count += 1 print(count) print(sum(1 for i in range(1,n+1) if n % i == 0))

word = input() result = {} for ch in word: if ch in result: result[ch] += 1 else: result[ch] = 1

arr = [3, 4, 5, 7] ans = "True" for x in range(len(arr)-1): if arr[x+1] == arr[x]+1: ans = "False" break print(ans) print(any(arr[x+1] == arr[x]+1 for x in range(len(arr)-1)))

str = "mississippi" answer = "" for ch in str: if ch != 's': answer += ch print(answer)

#include <stdio.h> int main() { int n = 4521; int sum = 0; int t = 1000; while(n > 0){ sum += n % 10 * t; n /= 10;

#include <stdio.h> int main() { int arr[10] = {3,5,1,2,6,2,8,1,2,2}; int b[10] = {}; for (int i = 1;i <= 9;i++) { b[arr[i]] += 1; }

#include <stdio.h> int main() { int arr[] = {3,5,1,2,6,2,8,1,2,2}; int n = sizeof(arr) / sizeof(arr[0]); int counts[100] = {0}; for (int i = 0; i < n; i++) { counts[arr[i]]++; }

#include <stdio.h> int main() { int n = 1204; while (n > 0) { int digit = n % 10; printf("%d", digit); n = n / 10; }

numbers = [2, 9, 4, 1] max_diff = 0 for i in range(len(numbers) - 1): diff = abs(numbers[i] - numbers[i+1]) if diff > max_diff: max_diff = diff print(max_diff)

def getMyDivisor(n): divisorsList = [] for i in range(1, n + 1): if (n % i == 0) : divisorsList.append(i) return divisorsList

n = 320 answer = 0 while n > 0: answer = answer * 10 + (n % 10) n //= 10 print(answer)

numbers = [3, 9, 2, 9, 1] print(numbers[-1])

numbers = [4, 7, 1, 9, 3] answer = 0 for i in range(len(numbers)): if i % 2 == 0: answer += numbers[i] print(answer)

import math arr = [[15,20],[36,48],[12,7],[121,44],[39,65]] list = [] answer = 0 a1 = 0 a2 = 0 a3 = 0 a4 = 0

arr = [3,1,1,4,5,9] arr.sort() M = 3 N = 6 li = 0 big = 0 answer = 0 for i in range(M): li += arr[i]

from collections import Counter arr = [1,2,3,4,4,5,6,7,7,8,9,9,9,9,10] count_result = Counter(arr) most_common_item = count_result.most_common(1) value = most_common_item[0][0]

arr = [4, 2, 1, 3, 9, 5, 6] M = 3 arr.sort() answer = 0 for i in range(len(arr)): if i % 3 ==0 and i!=0: answer += arr[i] print(answer)