Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
100691 | 汤奕硕 | 二进制数问题 | Python3 | Accepted | 32 MS | 3748 KB | 410 | 2024-12-10 20:43:22 |
def count_bits(n): count_1 = 0 count_0 = 0 while n > 0: if n % 2 == 1: count_1 += 1 else: count_0 += 1 n //= 2 return count_1, count_0 A_count = 0 B_count = 0 for i in range(1, 1001): count_1, count_0 = count_bits(i) if count_1 > count_0: A_count += 1 else: B_count += 1 print(A_count, B_count)