Codeforces 1594B 补题（快速幂）

Codeforces 1594B 补题

题目

B. Special Numbers
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Theofanis really likes sequences of positive integers, thus his teacher (Yeltsa Kcir) gave him a problem about a sequence that consists of only special numbers.

Let’s call a positive number special if it can be written as a sum of different non-negative powers of n. For example, for n=4 number 17 is special, because it can be written as 40+42=1+16=17, but 9 is not.

Theofanis asks you to help him find the k-th special number if they are sorted in increasing order. Since this number may be too large, output it modulo 109+7.

Input
The first line contains a single integer t (1≤t≤104) — the number of test cases.

The first and only line of each test case contains two integers n and k (2≤n≤109; 1≤k≤109).

Output
For each test case, print one integer — the k-th special number in increasing order modulo 109+7.

思路

k的二进制形式中的1其实就表示累加了以该位次为幂的底数的值。
比如n为3，k为13，此时k的二进制为1101。那么第k个以n为底的幂底数的累加就为3^0 + 3^2 + 3^3 = 39.
我们可以写出前16个3的幂底数的累加的排序

1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16
1	3	4	9	10	12	13	27	28	30	31	36	37	39	40	81

#include <iostream>
#include <string.h>
#include <algorithm>
#include <iomanip>
#define ll long long
using namespace std;
const int mod = 1e9 + 7;
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        ll n, k;
        cin >> n >> k;
        ll ans = 0, s = 1;
        while (k != 0)
        {
            if (k & 1)
            {
                ans = (ans + s) % mod;
            }
            s = s * n % mod;
            k = k >> 1; //右移运算，负数补1，正数补0
        }
        cout<<ans<<endl;
    }
    return 0;
}