JZOJ Day6 B组 T1 超级变变变

题目大意：

命$f(x)=x-1(xmod2=1)orx/2(xmod2=0)$
求区间$[A,B]$中有多少个x满足经过若干次变化后变为k

解题思路：

我们反推一下，发现
$k\to 2k+1ork\to 2k$
然后就是一颗二叉树
我们用倍增寻找$A<=x<=B$

$Acceptedcode:$

#include<cstdio>
#include<algorithm>

using namespace std;

long long a, b, k, m_2[63];

long long Solve(long long Max) {
	if ((!k) || (k == 1)) return Max;
	long long now = 0;
	if (k & 1) {
		now += (Max >= k);
		for (int i = 1; k * m_2[i] <= Max; ++i)
			now += min(m_2[i], Max - k * m_2[i] + 1);
		return now;
	}
	now += (Max >= k) + (Max >= k+1);
	for (int i = 1; k * m_2[i] <= Max; ++i)
		now += min(m_2[i+1], Max - k * m_2[i] + 1);
	return now;
}

int main() {
	scanf("%lld %lld %lld", &k, &a, &b);
	m_2[0] = 1;
	for (int i = 1; i <= 62; ++i) m_2[i] = m_2[i-1] << 1;
	printf("%lld\n", Solve(b) - Solve(a-1));
}