#P3048. [USACO12FEB] Cow IDs S

    ID: 2092 Type: RemoteJudge 1000ms 125MiB Tried: 0 Accepted: 0 Difficulty: 5 Uploaded By: Tags>2012USACO组合数学位运算

[USACO12FEB] Cow IDs S

题目描述

Being a secret computer geek, Farmer John labels all of his cows with binary numbers. However, he is a bit superstitious, and only labels cows with binary numbers that have exactly K "1" bits (1K10)(1 \le K \le 10). The leading bit of each label is always a "1" bit, of course. FJ assigns labels in increasing numeric order, starting from the smallest possible valid label -- a K-bit number consisting of all "1" bits. Unfortunately, he loses track of his labeling and needs your help: please determine the Nth label he should assign (1N107)(1 \le N \le 10^7).

FJ 给他的奶牛用二进制进行编号,每个编号恰好包含 KK111K101 \le K \le 10),且必须是 11 开头。FJ 按升序编号,第一个编号是由 KK11 组成。

请问第 NN1N1071 \le N \le 10^7)个编号是什么。

输入格式

  • Line 11: Two space-separated integers, NN and KK.
7 3 

10110