Algorithm/goorm

goorm 2진수의 1 개수, 범위 내의 약수

마띠(쥔장) 2020. 9. 15. 23:38

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(ans)

 

728x90