11.7
b进制分解
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define LL long long
#define N 1000010
using namespace std;
int S, T, a, b;
int f[N], pw[110];
int run(){
f[S] = 0;
for(int i=S+<
11.7
b进制分解
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define LL long long
#define N 1000010
using namespace std;
int S, T, a, b;
int f[N], pw[110];
int run(){
f[S] = 0;
for(int i=S+<