人生苦短，我用Python

#include <iostream>
#include <map>
using namespace std;
#define ll long long
#define Mod 10000007
ll x, C[60], num[60], cnt = 0;
ll Many[60];
map<ll, ll> mp;
ll qpow(ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = (a * ans) % Mod;
		a = (a * a) % Mod;
		b >>= 1;
	}
	return ans;
}
ll A(ll m, ll n) {
	if (n == 0) return 0;
	ll ans = 1;
	ll k = n - m + 1, op = 1;
	for (int i = n - m + 1; i <= n; i++) C[i] = i;
	while (op <= m) {
		if (C[k] % op == 0) {
			C[k] /= op;
			op++;
		} else k++;
	}
	
	for (int i = n - m + 1; i <= n; i++) ans *= C[i], ans %= Mod;

	return ans;
}
void init() {
	for (ll i = 0; i <= 56; i++) {
		ll k = 1;
		mp[k << i] = i;
	}
	return ;
}
ll ans = 1;
// 输入12，输出在Many[2]多了一位
// 因为有重复计入
// 考虑正向进行
void solve(ll x) {
	while (x) {
		ll op = x & (-x);
		num[++cnt] = mp[op];
		x -= op;
	}
	
	for (ll i = cnt; i >= 1; i--) {
		Many[cnt - i + 1] += 1;
		Many[cnt - i + 1] %= Mod;
		ll j = 1;
//		if (i == cnt) j = 1;
		for (; j <= num[i]; j++) {
			cout << Many[2] << " ";
			Many[j] += A(j, num[i]);
			Many[j] %= Mod;
			cout << Many[2] << " ";
			Many[j + 1] += A(j, num[i - 1]);
			Many[j + 1] %= Mod;
			
			cout << Many[2] << " ";
		}
	}
	
	for (ll i = 2; i <= 56; i++) {
		ans *= qpow(i, Many[i]);
		ans %= Mod;
//		if (i <= 4) cout << Many[i] << " ";
	}
	puts("");
	
	cout << ans;
	
	return ;
}
int main() {
	cin >> x;
	init();
	solve(x);


	return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;
const int N = 205;
string s;
int n, k;
int dp[N][N][2];
// 0~长度  1~次数(即x) 
//        双指针     操作次数 
int dfs(int l, int r, int x) {
	
	
	return x;
}
int main(){
	cin >> s >> k;
	n = s.size();
	
	dfs(0, n - 1, 0);
	
	
	return 0;
}

LCA

// f(儿子) = 父亲  洛谷3379 
#include <iostream>
#include <queue>
using namespace std;
const int N = 5e5 + 50;
int n, Q, start;
int x, y, a, b;
// 先用 图 存，然后遍历 构建 树
struct Node{
	int v;
	int nxt;
}edge[N];
int head[N << 1], cnt = 0;
void add(int u, int v){
	cnt++;
	edge[cnt].v = v;
	edge[cnt].nxt = head[u];
	head[u] = cnt;
	return ;
}
queue<int> Point;
bool vis[N];
int f[N];
void bfs() {
	Point.push(start); vis[start] = true;
	while (Point.size()) {
		int u = Point.front();  Point.pop();
		for (int i = head[u]; i; i = edge[i].nxt) {
			int v = edge[i].v;
			if (vis[v]) continue;
			Point.push(v);
			f[v] = u; // f(儿子) = 父亲 
		}
	}
	return ;
}

void solve(int a, int b) {
	
}


int main(){
	scanf("%d %d %d", &n, &Q, &start);
	for (int i = 1; i < n; i++) {
		scanf("%d %d", &x, &y);
		add(x, y);
		add(y, x);
	}
	
	bfs();
	
	while (Q--) {
		scanf("%d %d", &a, &b);
		solve(a, b);
	}
	
	
	
	return 0;
}