~~마띠의블로그~~

2진수의 1 개수 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n = bin(int(input())) blist =[] cnt = 0 for i in range(2, len(n)): if(n[i] == '1'): cnt += 1 print(cnt) 범위 내의 약수 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean a, n, m = map(int, input().split(' ')) ans = 0 for j in range(n, m+1): cnt = 0 for k in range(1, j+1): if(j % k == 0): cnt += 1 if(cnt == a): ans += 1 print(..

소수 판별 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n = int(input()) sw = 0 for i in range(2, n): if(n % i == 0): sw += 1 if(sw == 0): print("True") else: print("False") 고장난 컴퓨터 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n, tick = map(int, input().split(' ')) num = input().split(' ') cnt = 0 for i in range(0, n-1): if((int(num[i+1]) - int(num[i])) > tick): cnt = 0 el..

재원 넘버 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n = int(input()) cnt = 0 for i in range(1, n+1): cnt += 3 ** i print(cnt) 부모 단어 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n,m = input().split(' ') parent = [i for i in n] qst = [j for j in m] sw = 0 for k in range(len(qst)): if qst[k] not in parent: sw = 1 if(sw==0): print("YES") else: print("NO") 피자 쿠폰 #include us..

가위바위보 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean s = input().split(' ') x = 0 #가위 o = 0 #주먹 q = 0 #보 for i in range(5): if(s[i]=='1'): x += 1 elif(s[i]=='2'): o += 1 elif(s[i]=='3'): q += 1 if(x==0 and o!=0 and q!=0): print(q) elif(x!=0 and o==0 and q!=0): print(x) elif(x!=0 and o!=0 and q==0): print(o) else: print(0) 홀수 놀이 #include #include using namespace std; int main() { int ..

문자열 번갈아 출력하기 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean s = input() l = len(s) if(l%2==0): frt = s[0:int(l/2):1] lst = s[l-1:int(l/2)-1:-1] else: frt = s[0:int(l/2)+1:1] lst = s[l-1:int(l/2):-1] i = 0 while(1): if(i+1>len(frt)): break print(frt[i], end='') if(i+1>len(lst)): break print(lst[i], end='') i += 1 벡터의 +, - 연산 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean x..

최댓값 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n = int(input()) a = input().split(' ') max = int(a[0]) idx = 0 for i in range(n): if(int(a[i])>max): max = int(a[i]) idx = i print(max, idx+1) 전기요금 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n = int(input()) if(nn3>>n4; if(n2*2==n1+n3 && n3*2 == n2+n4){ int d = n2 - n1; cout

삼각형의 넓이 2 #include #include #include using namespace std; int main() { double a, b, c; double s, ans; cin >> a>> b>>c; s = (a+b+c)/2; ans = s * (s-a) * (s-b) * (s-c); ans = pow(ans,0.5); cout

두 점 사이의 거리 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean x1, y1 = map(int, input().split(' ')) x2, y2 = map(int, input().split(' ')) d = (x1-x2)**2 + (y1-y2)**2 d = d**(1/2) print(round(d,2)) n 구하기 #include using namespace std; int main() { int n; cin >> n; int sum = 0; int i = 0; while(1){ sum += i; i++; if(sum > n){ break; } } cout

최단거리 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean a = int(input()) ary = [] ary = input().split(' ') d = int(ary[1]) - int(ary[0]) for i in range(a-1): if((int(ary[i+1]) - int(ary[i])) int(m)): m = ary[i] print(m) 재정 위기 #include using namespace std; int main() { int a, b, c; cin >> a >> b >> c; if((b>=a&&c

완전 제곱수 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean n = int(input()) a = [] for i in range(n): a.append(int(input())) sum =0 for i in range(0, n): tmp = a[i] ** 0.5 if int(tmp) == tmp: if(tmp ** 2 == a[i]): sum += 1 print(sum) 앵무새 꼬꼬 # -*- coding: utf-8 -*- # UTF-8 encoding when using korean checkWord = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'] n = int(input()) slist =[] a..