글 읽기 - 함수 질문

kimjunsu5960 2년 전 1

할 수 있는 곳까지는 해봤는데 밑에 그림처럼 결과값이 나와야하는데 아무런 값이 안나옵니다 어디서 문제가 발생했는데 무엇을 빠뜨렸거나 코드를 잘못입력했을거라 생각하는데 어딘지 찾을 수가 없습니다 어디서 문제인지 왜 값이 아무것도 안나오는지 알려주실 수 있나요ㅠㅠ

이 사진이 결과로 구해야하는 값입니다.

제가 작성한 코드의 실행 결과입니다

import random, time
def genBigRandList(L,n):
    size = len(L)
    count = 0
    while count < size:
        s = ""
        i = 0
        while (i < per_line) and (count < size):
            s += "{0:>7} ".format(L[count])
            count += 1
            i += 1
        print(s) 
def printListSample(L, per_line = 10, sample_lines = 2): #함수
    count = 0
    size = len(L)
    for i in range(0, sample_lines): #범위
        s = ""
        for j in range(0, per_line):
            if count >= size: #조건
                break
            s += "{0:>7} ".format(L[count])
            count += 1
        print(s)
        if count >= size: #조건
            break
    if count < size: #조건
        print('. . . . . .') #출력
        if count < (size - per_line * sample_lines): #조건
            count = size - per_line * sample_lines
        for i in range(0, sample_lines): 
            s = ""
            for j in range(0, per_line):
                if count >= size:
                   break
                s += "{0:>7} ".format(L[count])
                count += 1
            print(s) #출력
            if count >= size:
                break
# merge sort
def _merge(L_left, L_right):
    L_res = []
    i, j = 0, 0
    len_left, len_right = len(L_left), len(L_right)
    while i < len_left and j < len_right:
        if L_left[i] < L_right[j]:
            L_res.append(L_left[i])
            i += 1
        else:
            L_res.append(L_right[j])
            j += 1
    while (i < len_left):
        L_res.append(L_left[i])
        i += 1
    while (j < len_right):
        L_res.append(L_right[j])
        j += 1
    return L_res
def mergeSort(L): # merge_sort in increasing order
    if len(L) < 2:
        return L[:]
    else:
        middle = len(L) // 2
        L_left = mergeSort(L[:middle])
        L_right = mergeSort(L[middle:])
        return_merge(L_left, L_right)

while True:
    print("\nPerformance test of merge sorting algorithm")
    size = int(input("Input size of random list L (-1 to quit) = "))
    if size == -1:
        break
    L = []
    genBigRandList(L, size)
    # testing MergeSorting
    print("\nBefore mergeSort of L :")
    printListSample(L, 10, 2)
    t1 = time.time()
    sorted_L = mergeSort(L)
    t2 = time.time()
    print("After mergeSort of L :")
    printListSample(sorted_L, 10, 2)
    time_elapsed = t2 - t1
    print("Merge sorting took {} sec".format(time_elapsed))

kimjunsu5960 2년 전 1

L.append를 사용하여 어떤걸 추가해야하죠...ㅠㅠㅠ 너무 죄송합니다

kimjunsu5960 2년 전 1

죄송합니다 너무 귀찮게하네요ㅠㅠㅠ 제가 자꾸 정의를 못하네요..

import random, time
random.randint(1,1000000)
def genBigRandList(L,n):
    size = n
    count = 0
    while count < size:
        s = ""
        i = 0
        while (i < per_line) and (count < size):
            s += "{0:>7} ".format(L[count])
            count += 1
            i += 1
        print(s) 
def printListSample(L, per_line = 10, sample_lines = 2): #함수
    count = 0
    size = len(L)
    for i in range(0, sample_lines): #범위
        s = ""
        for j in range(0, per_line):
            if count >= size: #조건
                break
            s += "{0:>7} ".format(L[count])
            count += 1
        print(s)
        if count >= size: #조건
            break
    if count < size: #조건
        print('. . . . . .') #출력
        if count < (size - per_line * sample_lines): #조건
            count = size - per_line * sample_lines
        for i in range(0, sample_lines): 
            s = ""
            for j in range(0, per_line):
                if count >= size:
                   break
                s += "{0:>7} ".format(L[count])
                count += 1
            print(s) #출력
            if count >= size:
                break
# merge sort
def _merge(L_left, L_right):
    L_res = []
    i, j = 0, 0
    len_left, len_right = len(L_left), len(L_right)
    while i < len_left and j < len_right:
        if L_left[i] < L_right[j]:
            L_res.append(L_left[i])
            i += 1
        else:
            L_res.append(L_right[j])
            j += 1
    while (i < len_left):
        L_res.append(L_left[i])
        i += 1
    while (j < len_right):
        L_res.append(L_right[j])
        j += 1
    return L_res
def mergeSort(L): # merge_sort in increasing order
    if len(L) < 2:
        return L[:]
    else:
        middle = len(L) // 2
        L_left = mergeSort(L[:middle])
        L_right = mergeSort(L[middle:])
        return_merge(L_left, L_right)

while True:
    print("\nPerformance test of merge sorting algorithm")
    size = int(input("Input size of random list L (-1 to quit) = "))
    if size == -1:
        break
    L = []
    genBigRandList(L, size)
    # testing MergeSorting
    print("\nBefore mergeSort of L :")
    printListSample(L, 10, 2)
    t1 = time.time()
    sorted_L = mergeSort(L)
    t2 = time.time()
    print("After mergeSort of L :")
    printListSample(sorted_L, 10, 2)
    time_elapsed = t2 - t1
    print("Merge sorting took {} sec".format(time_elapsed))

kimjunsu5960 2년 전 1

이렇게 해봤는데 처음이랑 똑같은 결과가 나옵니다. 제가 말씀해 주신 의도대로 못한 건가요 한번에 이해못하고 계속 질문해서 죄송합니다ㅠㅠ

import random, time
random.randint(1,1000000)
def genBigRandList(L,n):
    size = n
    count = 0
    while count < size:
            lst = []
            a = random.randint(1,100000)
            lst.append(a)
            count += 1
def printListSample(L, per_line = 10, sample_lines = 2): #함수
    count = 0
    size = len(L)
    for i in range(0, sample_lines): #범위
        s = ""
        for j in range(0, per_line):
            if count >= size: #조건
                break
            s += "{0:>7} ".format(L[count])
            count += 1
        print(s)
        if count >= size: #조건
            break
    if count < size: #조건
        print('. . . . . .') #출력
        if count < (size - per_line * sample_lines): #조건
            count = size - per_line * sample_lines
        for i in range(0, sample_lines): 
            s = ""
            for j in range(0, per_line):
                if count >= size:
                   break
                s += "{0:>7} ".format(L[count])
                count += 1
            print(s) #출력
            if count >= size:
                break
# merge sort
def _merge(L_left, L_right):
    L_res = []
    i, j = 0, 0
    len_left, len_right = len(L_left), len(L_right)
    while i < len_left and j < len_right:
        if L_left[i] < L_right[j]:
            L_res.append(L_left[i])
            i += 1
        else:
            L_res.append(L_right[j])
            j += 1
    while (i < len_left):
        L_res.append(L_left[i])
        i += 1
    while (j < len_right):
        L_res.append(L_right[j])
        j += 1
    return L_res
def mergeSort(L): # merge_sort in increasing order
    if len(L) < 2:
        return L[:]
    else:
        middle = len(L) // 2
        L_left = mergeSort(L[:middle])
        L_right = mergeSort(L[middle:])
        return_merge(L_left, L_right)

while True:
    print("\nPerformance test of merge sorting algorithm")
    size = int(input("Input size of random list L (-1 to quit) = "))
    if size == -1:
        break
    L = []
    genBigRandList(L, size)
    # testing MergeSorting
    print("\nBefore mergeSort of L :")
    printListSample(L, 10, 2)
    t1 = time.time()
    sorted_L = mergeSort(L)
    t2 = time.time()
    print("After mergeSort of L :")
    printListSample(sorted_L, 10, 2)
    time_elapsed = t2 - t1
    print("Merge sorting took {} sec".format(time_elapsed))

kimjunsu5960 2년 전 1

return_merge도 따로 정의해줘야하나요ㅠㅠㅠ 아니면 그냥 지워버리면되나요

import random, time
def genBigRandList(L,n):
    size = n
    count = 0
    while count < size:
            a = random.randint(1,100000)
            L.append(a)
            count += 1
def printListSample(L, per_line = 10, sample_lines = 2): #함수
    count = 0
    size = len(L)
    for i in range(0, sample_lines): #범위
        s = ""
        for j in range(0, per_line):
            if count >= size: #조건
                break
            s += "{0:>7} ".format(L[count])
            count += 1
        print(s)
        if count >= size: #조건
            break
    if count < size: #조건
        print('. . . . . .') #출력
        if count < (size - per_line * sample_lines): #조건
            count = size - per_line * sample_lines
        for i in range(0, sample_lines): 
            s = ""
            for j in range(0, per_line):
                if count >= size:
                   break
                s += "{0:>7} ".format(L[count])
                count += 1
            print(s) #출력
            if count >= size:
                break
# merge sort
def _merge(L_left, L_right):
    L_res = []
    i, j = 0, 0
    len_left, len_right = len(L_left), len(L_right)
    while i < len_left and j < len_right:
        if L_left[i] < L_right[j]:
            L_res.append(L_left[i])
            i += 1
        else:
            L_res.append(L_right[j])
            j += 1
    while (i < len_left):
        L_res.append(L_left[i])
        i += 1
    while (j < len_right):
        L_res.append(L_right[j])
        j += 1
    return L_res
def mergeSort(L): # merge_sort in increasing order
    if len(L) < 2:
        return L[:]
    else:
        middle = len(L) // 2
        L_left = mergeSort(L[:middle])
        L_right = mergeSort(L[middle:])
        return_merge(L_left, L_right)
    print("\nPerformance test of merge sorting algorithm")
    size = int(input("Input size of random list L (-1 to quit) = "))
    if size == -1:
        break
    L = []
    genBigRandList(L, size)
    # testing MergeSorting
    print("\nBefore mergeSort of L :")
    printListSample(L, 10, 2)
    t1 = time.time()
    sorted_L = mergeSort(L)
    t2 = time.time()
    print("After mergeSort of L :")
    printListSample(sorted_L, 10, 2)
    time_elapsed = t2 - t1
    print("Merge sorting took {} sec".format(time_elapsed))

kimjunsu5960 2년 전 1

break outside loop가 뜹니다ㅠㅠ

import random, time
def genBigRandList(L,n):
    size = n
    count = 0
    while count < size:
            a = random.randint(1,100000)
            L.append(a)
            count += 1
def printListSample(L, per_line = 10, sample_lines = 2): #함수
    count = 0
    size = len(L)
    for i in range(0, sample_lines): #범위
        s = ""
        for j in range(0, per_line):
            if count >= size: #조건
                break
            s += "{0:>7} ".format(L[count])
            count += 1
        print(s)
        if count >= size: #조건
            break
    if count < size: #조건
        print('. . . . . .') #출력
        if count < (size - per_line * sample_lines): #조건
            count = size - per_line * sample_lines
        for i in range(0, sample_lines): 
            s = ""
            for j in range(0, per_line):
                if count >= size:
                   break
                s += "{0:>7} ".format(L[count])
                count += 1
            print(s) #출력
            if count >= size:
                break
# merge sort
def _merge(L_left, L_right):
    L_res = []
    i, j = 0, 0
    len_left, len_right = len(L_left), len(L_right)
    while i < len_left and j < len_right:
        if L_left[i] < L_right[j]:
            L_res.append(L_left[i])
            i += 1
        else:
            L_res.append(L_right[j])
            j += 1
    while (i < len_left):
        L_res.append(L_left[i])
        i += 1
    while (j < len_right):
        L_res.append(L_right[j])
        j += 1
    return L_res
def mergeSort(L): # merge_sort in increasing order
    if len(L) < 2:
        return L[:]
    else:
        middle = len(L) // 2
        L_left = mergeSort(L[:middle])
        L_right = mergeSort(L[middle:])
        return _merge(L_left, L_right)
    print("\nPerformance test of merge sorting algorithm")
    size = int(input("Input size of random list L (-1 to quit) = "))
    if size == -1:
        break
    L = []
    genBigRandList(L, size)
    # testing MergeSorting
    print("\nBefore mergeSort of L :")
    printListSample(L, 10, 2)
    t1 = time.time()
    sorted_L = mergeSort(L)
    t2 = time.time()
    print("After mergeSort of L :")
    printListSample(sorted_L, 10, 2)
    time_elapsed = t2 - t1
    print("Merge sorting took {} sec".format(time_elapsed))

kimjunsu5960 2년 전 1

제가 계속 이해못하고 질문해서 시간 많이 빼앗기셨을텐데 계속 친절하게 답변해주시고 알려주셔서 너무 감사합니다ㅠㅠㅠㅠ그리고 제가 파이썬을 잘 못해서 알아듣지 못해서 답답하셨는데 죄송하고 감사합니다ㅠㅠㅠ 오늘 알려주신 코드 다시 보면서 열심히 공부하고 파이썬 실력 키우겠습니다 너무 감사합니다ㅠㅠㅠㅠㅠㅠㅠ

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

함수 질문

kimjunsu5960 2년 전 1

kimjunsu5960 2년 전 1

kimjunsu5960 2년 전 1

kimjunsu5960 2년 전 1

kimjunsu5960 2년 전 1

kimjunsu5960 2년 전 1

kimjunsu5960 2년 전 1

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말