하헌석 ProgrammersLevel1

Level1/Lessons12901/hakamma.py

@@ -0,0 +1,12 @@
+2016년 연습문제 (날짜)
+
+def solution(a, b):
+    answer = ''
+    month = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
+    day = ["FRI", "SAT", "SUN", "MON", "TUE", "WED", "THU"]
+    x = 0
+    for i in range(0, a-1):
+        x = x+month[i]
+
+    answer = day[(x+b-1)%7]
+    return answer

Level1/Lessons12903/hakamma.py

@@ -0,0 +1,9 @@
+가운데 글자 찾기
+
+def solution(s):
+    answer = ''
+    if len(s) % 2 == 0:
+        return s[(len(s)//2)-1:(len(s)//2)+1] // index로 접근
+    else:
+        return s[len(s)//2]
+    return answer

Level1/Lessons12906/hakamma.py

@@ -0,0 +1,13 @@
+#12906 ���� ���ڴ� �Ⱦ� 
+
+def solution(arr):
+    answer = []
+    for i in range(0,len(arr)):
+        if i == 0:
+            answer.append(arr[i])
+        else:
+            if arr[i] == arr[i-1]:
+                continue
+            else:
+                answer.append(arr[i])
+    return answer

Level1/Lessons12910/hakamma.py

@@ -0,0 +1,13 @@
+#12910 ������ �������� ���� �迭
+
+def solution(arr, divisor):
+    answer = []
+    for i in range(0,len(arr)):
+        if arr[i] % divisor == 0:
+            answer.append(arr[i])
+
+    answer.sort()
+    if len(answer) == 0:
+        answer.append(-1)
+
+    return answer

Level1/Lessons12912/hakamma.py

@@ -0,0 +1,12 @@
+#12912 �� ���� ������ ��
+
+def solution(a, b):
+    answer = 0
+    if a<=b:
+        for i in range(a,b+1):
+            answer += i
+    else:
+        for i in range(b,a+1):
+            answer += i
+
+    return answer

Level1/Lessons12915/hakamma.py

@@ -0,0 +1,16 @@
+#12915 문자열 내 마음대로 정렬하기
+
+def solution(strings, n):
+    answer = []
+    a = []
+    strings.sort()
+    for i in strings:
+        a.append(i[n])
+    a.sort()
+
+    for j in a:
+        for k in range(len(a)):
+            if j == strings[k][n]:
+                answer.append(strings[k])
+                strings[k] = '0'*100 # 중복방지를 위해 요소의 값 변경
+    return answer

Level1/Lessons12916/hakamma.py

@@ -0,0 +1,17 @@
+#12916 ���ڿ� �� p�� y�� ����
+
+def solution(s):
+    answer = True
+    s1 = s.lower()
+    pcount = 0
+    ycount = 0
+    for i in range(len(s1)):
+        if s1[i] == 'p':
+            pcount += 1
+        elif s1[i] == 'y':
+            ycount += 1
+    if pcount == ycount:
+        answer = True
+    elif pcount != ycount:
+        answer = False
+    return answer

Level1/Lessons12917/hakamma.py

@@ -0,0 +1,16 @@
+#12917 ���ڿ� ������������ ��ġ�ϱ�
+
+def solution(s):
+    answer = ''
+    s1 = s.lower()
+    upper_char = []
+    lower_char = []
+    for i in range(len(s)):
+        if s[i] == s1[i]:
+            lower_char.append(s[i])
+        else:
+            upper_char.append(s[i])
+    upper_char.sort(reverse=True)
+    lower_char.sort(reverse=True)
+    answer = "".join(lower_char) + "".join(upper_char)
+    return answer

Level1/Lessons12918/hakamma.py

@@ -0,0 +1,8 @@
+#12918 ���ڿ� �ٷ�� �⺻
+
+def solution(s):
+    answer = False
+    if len(s) == 4 or len(s) == 6:
+        if s.isdigit() == True:
+            answer = True
+    return answer

Level1/Lessons12919/hakamma.py

@@ -0,0 +1,7 @@
+#12919 ���￡�� �輭�� ã��
+
+def solution(seoul):
+    answer = ''
+    a = seoul.index("Kim")
+    answer = '�輭���� '+ str(a) +'�� �ִ�'
+    return answer

Level1/Lessons12921/hakamma.py

@@ -0,0 +1,9 @@
+#12921 �Ҽ� ã��
+
+def solution(n):
+    num=set(range(2,n+1)) # 2���� n+1������ ����
+
+    for i in range(2,n+1): # 2���� n���� �ݺ���
+        if i in num: # ���� i�� num ���տ� �ִٸ�
+            num-=set(range(2*i,n+1,i)) # i�� ����� num ���տ��� ����
+    return len(num) # num�� �����ִ� ������ ������ �Ҽ��� ����

Level1/Lessons12922/hakamma.py

@@ -0,0 +1,10 @@
+#12922 ���ڼ��ڼ��ڼ�?
+
+def solution(n):
+    answer = ''
+    for i in range(n):
+        if i%2 == 0:
+            answer += "��"
+        elif i%2 == 1:
+            answer += "��"
+    return answer

Level1/Lessons12925/hakamma.py

@@ -0,0 +1,9 @@
+#12925 ���ڿ��� ������ �ٲٱ�
+
+def solution(s):
+    answer = 0
+    if s[0] == '-':
+        answer = -int(s[1:])
+    else:
+        answer = int(s[:])
+    return answer

Level1/Lessons12926/hakamma.py

@@ -0,0 +1,16 @@
+#12926 ���� ��ȣ
+
+def solution(s, n):
+    low_char = "abcdefghijklmnopqrstuvwxyz"
+    up_char = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+    answer = ''
+    for char in s:
+        if char in low_char:
+            ind = low_char.find(char)+n # low ���ڿ����� ã�� �ش� ���ĺ� �ε��� + n
+            answer += low_char[ind%26] # 26���� ���� �������� ����� ��� 25�� �ʰ��ϴ� ��쵵 Ȱ�� ����
+        elif char in up_char:
+            ind = up_char.find(char)+n
+            answer += up_char[ind%26]
+        else:
+            answer += " "
+    return answer

Level1/Lessons12928/hakamma.py

@@ -0,0 +1,12 @@
+#12928 ����� ��
+
+def solution(n):
+    answer = 0
+    for i in range(1,n+1):
+        if n%i == 0:
+            answer += i
+    if n == 0:
+        answer = 0
+    elif n == 1:
+        answer = 1
+    return answer

Level1/Lessons12930/hakamma.py

@@ -0,0 +1,14 @@
+#12930 �̻��� ���� �����
+
+def solution(s):
+    answer = ''
+    new_s = s.split(' ')
+
+    for char in new_s:
+        for i in range(len(char)):
+            if i%2 == 0:
+                answer += char[i].upper()
+            elif i%2 == 1:
+                answer += char[i].lower()
+        answer += ' '
+    return answer[:-1]

Level1/Lessons12931/hakamma.py

@@ -0,0 +1,8 @@
+#12931 자릿수 더하기
+
+def solution(n):
+    answer = 0
+    n_number = str(n)
+    for i in range(len(n_number)):
+        answer += int(n_number[i])
+    return answer

Level1/Lessons12932/hakamma.py

@@ -0,0 +1,8 @@
+#12932 자연수 뒤집어 배열로 만들기
+
+def solution(n):
+    answer = []
+    n_number = str(n)
+    for i in range(len(n_number)):
+        answer.append(int(n_number[len(n_number)-i-1]))
+    return answer

Level1/Lessons12933/hakamma.py

@@ -0,0 +1,13 @@
+#12933 정수 내림차순으로 배치하기
+
+def solution(n):
+    answer = 0
+    n_number = str(n)
+    t = []
+    for i in range(len(n_number)):
+        t.append(int(n_number[len(n_number)-i-1]))
+
+    t.sort(reverse=True)
+    s=''.join(map(str,t)) # 리스트를 특정 구분자를 포함해 문자열로 변환
+    answer = int(s)
+    return answer

Level1/Lessons12934/hakamma.py

@@ -0,0 +1,10 @@
+#12934 정수 제곱근 판별
+
+def solution(n):
+    answer = 0
+    a = n**(1/2)
+    if int(a) == a:
+        answer = (a+1)**2
+    else:
+        answer = -1
+    return answer

Level1/Lessons12935/hakamma.py

@@ -0,0 +1,11 @@
+#12935 ���� ���� �� �����ϱ�
+
+def solution(arr):
+    answer = []
+    if len(arr) > 1:
+        arr.remove(min(arr))
+        answer = arr
+    else:
+        answer = [-1]
+
+    return answer

Level1/Lessons12937/hakamma.py

@@ -0,0 +1,9 @@
+#12937 ¦���� Ȧ��
+
+def solution(num):
+    answer = ''
+    if num % 2 == 0:
+        answer = 'Even'
+    else:
+        answer = 'Odd'
+    return answer

Level1/Lessons12940/hakamma.py

@@ -0,0 +1,19 @@
+#12940 �ִ������� �ּҰ����
+
+def solution(n, m):
+    answer = []
+    max_answer = 0
+    min_answer = 0
+    if n >= m:
+        for i in range(1,n+1):
+            if n % i == 0 and m % i == 0:
+                max_answer = i
+        answer.append(max_answer)
+    elif n < m:
+        for j in range(1,m+1):
+            if n % j == 0 and m % j == 0:
+                max_answer = j
+        answer.append(max_answer)
+    min_answer = n * m / max_answer
+    answer.append(min_answer)
+    return answer

Level1/Lessons12943/hakamma.py

@@ -0,0 +1,15 @@
+#12943 �ݶ��� ����
+
+def solution(num):
+    answer = 0
+    while True:
+        if num == 1:
+            return answer
+        if num % 2 == 0:
+            num = num/2
+        elif num % 2 == 1:
+            num = num * 3 + 1
+        if answer == 500:
+            return -1
+        answer += 1
+    return answer

Level1/Lessons12944/hakamma.py

@@ -0,0 +1,9 @@
+#12944 ��� ���ϱ�
+
+def solution(arr):
+    answer = 0
+    sum_arr = 0
+    for i in range(len(arr)):
+        sum_arr += (arr[i])
+    answer = float(sum_arr) / float(len(arr))
+    return answer

Level1/Lessons12947/hakamma.py

@@ -0,0 +1,13 @@
+#12947 �ϻ��� ��
+
+def solution(x):
+    answer = True
+    arr = list(str(x))
+    sum_arr = 0
+    for i in range(len(arr)):
+        sum_arr += int(arr[i])
+    if x%sum_arr == 0:
+        answer = True
+    elif x%sum_arr != 0:
+        answer = False
+    return answer

Level1/Lessons12948/hakamma.py

@@ -0,0 +1,10 @@
+#12948 �ڵ��� ��ȣ ������
+
+def solution(phone_number):
+    answer = ''
+    for i in range(len(phone_number)):
+        if len(phone_number) - i <=4:
+            answer += phone_number[i]
+        else:
+            answer += '*'
+    return answer

Level1/Lessons12950/hakamma.py

@@ -0,0 +1,8 @@
+#12950 ����� ����
+
+def solution(arr1, arr2):
+    answer = arr1
+    for i in range(len(arr1)):
+        for j in range(len(arr1[i])):
+            answer[i][j] = arr1[i][j] + arr2[i][j]
+    return answer

Level1/Lessons12954/hakamma.py

@@ -0,0 +1,7 @@
+#12954 x��ŭ ������ �ִ� n���� ����
+
+def solution(x, n):
+    answer = []
+    for i in range(0,n):
+        answer.append(x*(i+1))
+    return answer

Level1/Lessons12969/hakamma.py

@@ -0,0 +1,5 @@
+#12969 ���簢�� �� ���
+
+a, b = map(int, input().strip().split(' '))
+for i in range(0,b):
+    print("*"*a)