문제해결형프로그래밍 by 서정욱

# exercise 37: A Trio Who Gave up Math in the Mock Test

jwseo — 2023-11-15 05:12:49 UTC

최법관(202378024)

jwseo — 2023-11-15 05:19:22 UTC

임현준(202378026)

jwseo — 2023-11-15 05:19:46 UTC

list=[13,2,8,22,3,1,18,15,12,5,10,19,6,16,7,20]

input_=int(input())

for i in range(len(list)):

if(input_==list[i]):

print(i)

왕희원(202378040)

jwseo — 2023-11-15 05:21:17 UTC

n=int(input())

arr=[13,2,8,22,3,1,18,15,12,5,10,19,6,16,7,20]

result=0

for i in arr:

if i==n:

result=arr.index(n)

break

else:

result=-1

print(result)

류찬(202378042)

jwseo — 2023-11-15 05:21:43 UTC

a = int(input())

list = [13,2,8,22,3,1,18,15,12,5,10,19,6,16,7,20]

try:

result = list.index(a)

except ValueError:

result = -1

break

print(result)

이현규(202378046)

jwseo — 2023-11-15 05:28:00 UTC

김용하(202378071)

jwseo — 2023-11-15 05:29:45 UTC

n = int(input())

nums = [13, 2, 8, 22, 3, 1, 18, 15, 12, 5, 10, 19, 6, 16, 7, 20]

result = -1

for i in range(len(nums)):

if n == nums[i]:

result = i

break

print(result)

조수빈(202378084)

jwseo — 2023-11-15 05:34:46 UTC

홍윤화(202378128)

jwseo — 2023-11-15 05:36:08 UTC

박상우(202378142)

jwseo — 2023-11-15 05:36:56 UTC

김영준(202378146)

jwseo — 2023-11-15 05:37:40 UTC

n = int(input().strip())

list_sample = list(map(int, input().strip().split()))

m = int(input().strip())

user = map(int, input().strip().split())

for _ in range(m):

for i in user:

if i in list_sample:

print(1)

else:

print(0)

오유빈(202378165)

jwseo — 2023-11-15 06:18:20 UTC

def binarySearch(listData, value):

low = 0

high = len(listData) - 1

count = 0

while (low <= high):

mid = (low + high) / 2

if (listData[mid] == value):

return mid

elif (listData[mid] < value):

low = mid + 1

else:

high = mid - 1

return count

신동준(202378194)

jwseo — 2023-11-15 06:19:13 UTC

이명신(202378195)

jwseo — 2023-11-15 06:19:35 UTC

명유찬(202378201)

jwseo — 2023-11-15 06:20:12 UTC

a=int(input())

b=list(map(int,input().split()))

c=int(input())

d=list(map(int,input().split()))

for i in d:

if i in b:

print(1)

else:

print(0)

김진숙(202378207)

jwseo — 2023-11-15 06:22:14 UTC

n = int(input().strip())
list_sample = list(map(int, input().strip().split()))
m = int(input().strip())  
user = map(int, input().strip().split())

for _ in range(m):
    for i in user:
        if i in list_sample:
            print(1)
        else:
            print(0)

최원준(202378213)

jwseo — 2023-11-15 06:23:05 UTC

박희지(202378235)

jwseo — 2023-11-15 06:23:21 UTC

박종휘(202378236)

jwseo — 2023-11-15 06:23:44 UTC

최우성(202378086)

jwseo — 2023-11-15 06:24:47 UTC

유동훈(202378200)

202378200 — 2023-11-16 04:49:16 UTC

def blackjack(N, M, cards):

max_sum = 0

for i in range(N - 2):

for j in range(i + 1, N - 1):

for k in range(j + 1, N):

current_sum = cards[i] + cards[j] + cards[k]

if current_sum <= M and current_sum > max_sum:

max_sum = current_sum

return max_sum

# 입력 받기

N, M = map(int, input().split())

cards = list(map(int, input().split()))

# 결과 출력

result = blackjack(N, M, cards)

print(result)

배현욱(202378007)

2023-11-16 05:17:53 UTC

서영빈(202378143)

2023-11-30 04:55:15 UTC

남재욱(202378180)

2023-11-30 04:55:49 UTC

이민정(202378053)

2023-11-30 04:55:51 UTC

진요셉(202378132)

b4zbhybxz4_ — 2023-11-30 04:55:51 UTC

a=int(input())

b=[13,2,8,22,3,1,18,15,12,5,10,19,6,16,7,20]

c=-1

for i in b:

c+=1

if i == a:

print(c)

break

else:

print(-1)

break

정승원 (202378023)

2023-11-30 04:56:12 UTC

김동윤(202378153)

2023-11-30 04:56:52 UTC

n = int(input())

nums = [13, 2, 8, 22, 3, 1, 18, 15, 12, 5, 10, 19, 6, 16, 7, 20]

result = -1

for i in range(len(nums)):

if n == nums[i]:

result = i

break

print(result)

백성렬 (202378160)

2023-11-30 04:58:37 UTC

list_sample = [13, 2, 8, 22, 3, 1, 18, 15, 12, 5, 10, 19, 6, 16, 7, 20]

idx = -1

user = int(input().strip())

for i in range(len(list_sample)):

if user == list_sample[i]:

idx = i

break

print(idx)

이혜룡(202378119)

dyddl0591_1 — 2023-11-30 05:02:26 UTC

김우석(202378116)

2023-11-30 05:02:35 UTC

최성우(202378013)

2023-11-30 05:06:21 UTC

김태연(202378167)

2023-11-30 05:16:39 UTC

n=int(input())
a=[13,2,8,22,3,1,18,15,12,5,10,19,6,16,7,20]
result=-1
for i in range(len(a)):
    if n==a[i]:
        result=i
        break
print(result)

장준호(202378081)

2023-11-30 05:41:22 UTC

N, M = map(int, input().split())

card_num = list(map(int, input().split()))

result = 0

for i in range(N):

for j in range(i + 1, N):

for z in range(j + 1, N):

card_combi_sum = card_num[i] + card_num[j] + card_num[z]

if card_combi_sum <= M:

result = max(result, card_combi_sum)

print(result)

n = int(input()) # 정수 개수 N

jwseo — 2023-11-30 05:45:33 UTC

서정욱 교수

jwseo — 2023-11-30 06:20:44 UTC

# exercise 39: Existence of Integer in Array

n = int(input()) # 정수 개수 N

# N개의 정수 집합(A[1],...,A[N])

nums_a = list(map(int, input().split()))

m = int(input()) # 찾고자 하는 정수 X의 개수

# 찾고자 하는 정수 X 집합

nums_x = list(map(int, input().split()))

"""

이진 탐색으로 구현하기

1. nums_a를 오름차순 정렬

2. 이진 탐색 수행

"""

nums_a.sort() # 오름차순 정렬

for i in range(m): # 정수 X 탐색

low = 0

high = n-1

isExist = False

while low <= high:

mid = int((low + high) / 2)

if nums_x[i] == nums_a[mid]:

isExist = True

print(1)

break

elif nums_x[i] > nums_a[mid]:

low = mid + 1

else:

high = mid - 1

if not isExist:

print(0)

문제해결형프로그래밍 by 서정욱

# exercise 37: A Trio Who Gave up Math in the Mock Test

최법관(202378024)

임현준(202378026)

왕희원(202378040)

류찬(202378042)

이현규(202378046)

김용하(202378071)

조수빈(202378084)

홍윤화(202378128)

박상우(202378142)

김영준(202378146)

오유빈(202378165)

신동준(202378194)

이명신(202378195)

명유찬(202378201)

김진숙(202378207)

최원준(202378213)

박희지(202378235)

박종휘(202378236)

최우성(202378086)

유동훈(202378200)

배현욱(202378007)

서영빈(202378143)

남재욱(202378180)

이민정(202378053)

진요셉(202378132)

정승원 (202378023)

김동윤(202378153)

백성렬 (202378160)

이혜룡(202378119)

김우석(202378116)

최성우(202378013)

김태연(202378167)

장준호(202378081)

n = int(input()) # 정수 개수 N

**** 서정욱 교수 ****

서정욱 교수