1002 : 최대공약수, 최소공배수 def gcd(a,b): if(a%b==0): return b return gcd(b,a%b) def lcm(a,b): return a*b//gcd(a,b) n = int(input()) arr=list(map(int,input().split())) g=l=arr[0] for i in range(1,n): g=gcd(g,arr[i]) l=lcm(l,arr[i]) print(g,l) 정올문제풀이 2021.11.27
1658 : 최대공약수와최소공배수 def gcd(a,b): if(a%b==0): return b return gcd(b,a%b) def lcm(a,b): return a*b//gcd(a,b) a,b = map(int,input().split()) print(gcd(a,b)) print(lcm(a,b)) 정올문제풀이 2021.11.27
2809 : 약수 import math n = int(input()) arr=set() for i in range(1,int(math.sqrt(n))+1): if(n%i==0): arr.add(i) arr.add(n//i) for i in sorted(arr): print(i,end=' ') 정올문제풀이 2021.11.27
1402 : 약수 구하기 n,k = map(int,input().split()) cnt=0 for i in range(1,n+1): if n % i == 0: cnt+=1 if(cnt==k): print(i) exit() print(0) 정올문제풀이 2021.11.27
1071 : 약수와 배수 n = int(input()) arr = list(map(int,input().split())) m = int(input()) y=0 x=0 for i in arr: if i % m==0 : x+=i if m % i ==0 : y += i print(y) print(x) 정올문제풀이 2021.11.27
1430 : 숫자의 개수 a = int(input()) b = int(input()) c = int(input()) d = a * b * c cnt = [0 for i in range(11)] while d>0 : cnt[d % 10]+=1 d//=10 for i in range(10): print(cnt[i]) 정올문제풀이 2021.11.27
1692 : 곱셈 a = int(input()) b = int(input()) print(a * (b%10)) print(a * ((b//10)%10)) print(a * ((b//100)%10)) print(a * b) 정올문제풀이 2021.11.27
1339 : 문자삼각형2 n = int(input()) if n % 2 ==0 or n 100 : print('INPUT ERROR') exit() arr = [[0 for i in range(n+1)] for j in range(n+1)] alph=ord('A') y=n//2 x=n//2 for i in range(1,n+1,2): for j in range(i): arr[y+j][x]=alph alph+=1 if alph > ord('Z'): alph = ord('A') y-=1 x-=1 for i in range(n): for j in range(n): if arr[i][j]==0: print(' ',end=' ') else: print(chr(arr[i][j]),end=' ') print() 정올문제풀이 2021.11.27
1338 : 문자삼각형1 n = int(input()) arr = [[0 for i in range(n+1)] for j in range(n+1)] alph=ord('A') y=0 x=n-1 for i in range(n,0,-1): for j in range(i): arr[y+j][x-j]=alph alph+=1 if alph > ord('Z'): alph = ord('A') y+=1 for i in range(n): for j in range(n): if arr[i][j]==0: print(' ',end=' ') else: print(chr(arr[i][j]),end=' ') print() 정올문제풀이 2021.11.27
1314 : 문자사각형2 n = int(input()) arr = [[0 for i in range(n+1)] for j in range(n+1)] alph=ord('A') for i in range(n): if i %2==0: for j in range(n): arr[j][i]=alph alph+=1 if alph > ord('Z'): alph = ord('A') else : for j in range(n): arr[n-1-j][i]=alph alph+=1 if alph > ord('Z'): alph = ord('A') for i in range(n): for j in range(n): print(chr(arr[i][j]),end=' ') print() 정올문제풀이 2021.11.27