首先由图形很容易想到递归求解。
采用分治的方法,分别计算出B行之前和A-1行之前的红气球总数,那么A~B行的气球总数就是两者相减。
采用分治的方法,分别计算出B行之前和A-1行之前的红气球总数,那么A~B行的气球总数就是两者相减。
#include <set>
#include <map>
#include <ctime>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <algorithm>
#define SF(a) scanf("%d", &a)
#define PF(a) printf("%d\n", a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SFFFF(a, b, c, d) scanf("%d%d%d%d", &a, &b, &c, &d)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 505
#define maxm 205
#define mod 1000000007
#define INF 1000000007
#define eps 1e-4
using namespace std;
int buf[20], l;
int read() {
int x = 0; char ch = getchar(); bool f = 0;
while (ch < '0' || ch > '9') { if (ch == '-') f = 1; ch = getchar(); }
while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
return f ? -x : x;
}
void write(int x) {
if (!x) { putchar(48); return; }
l = 0; if (x < 0) putchar('-'), x = -x;
while (x) buf[++l] = x % 10, x = x / 10;
while (l) putchar(buf[l--] + 48);
}
//-------------------------CHC------------------------------//
LL c(int k) {
LL ret = 1;
while (k--) ret *= 3;
return ret;
}
LL f(int k, int i) {
if (i == 1) return ((LL)1 << k);
if (i == 0) return 0;
if (i >= (1 << (k - 1))) return 2 * c(k - 1) + f(k - 1, i - (1 << (k - 1)));
else return 2 * f(k - 1, i);
}
int main() {
int t, kase = 1, a, b, k;
SF(t);
while (t--) {
SFFF(k, a, b);
LL ans;
ans = f(k, b) - f(k, a - 1);
printf("Case %d: %lld\n", kase++, ans);
}
return 0;
}