牛客练习赛27(A,C,E题解)

A纸牌
最优解为
$a-\frac{b}{2}=\frac{n}{2},b-a=\frac{n}{2},a-b=0$(n is even)
$a-\frac{b+1}{2}=\frac{n-1}{2},b-a=\frac{n+1}{2},a-\frac{n-1}{2}=0$(n is odd)
最终$a+b=\lfloor \frac{n+1}{2}\rfloor$

#include <cstdio>
using namespace std;
int main() {
	int n;
	scanf("%d", &n);
	printf("%d\n", (n + 1) / 2);
	return 0;
}

C水图
可以发现每条边都要被走两次（除了最后一条路径上的边）
于是题目转换为求从$x$出发最长的一条边的$le{n}_{max}$
最终答案为$ans=2\times \sum w-le{n}_{max}$

#include <cstdio>
#include <algorithm>
#define N 50010

typedef long long LL;
using namespace std;

int cnt, lst[N];
LL del;

struct Node{
	int to, nxt;
	LL len;
}e[N << 1];

inline void add(int u, int v, LL w) {
	e[++cnt].to = v;
	e[cnt].nxt = lst[u];
	e[cnt].len = w;
	lst[u] = cnt;
}

void dfs(int x, int fa, LL sum) {
	del = max(del, sum);
	for (int i = lst[x]; i; i = e[i].nxt) {
		int son = e[i].to;
		if (son == fa) continue;
		dfs(son, x, sum + e[i].len);
	}
}

int main() {
	int n, x;
	scanf("%d%d", &n, &x);
	LL ans = 0;
	for (int i = 1; i < n; ++i) {
		int u, v;
		LL w;
		scanf("%d%d%lld", &u, &v, &w);
		add(u, v, w);
		add(v, u, w);
		ans += w;
	}
	ans *= 2;
	dfs(x, x, 0);
	ans -= del;
	printf("%lld\n", ans);
}

E欧拉
别的不多说了，直接搞式子
设
$$n=p_1^{k_1}{p}_2^{k_2}{p}_3^{k_3}...p_r^{k_r}(p_i̸=p_j)$$
$$q^t|x(t>1)\to \mu (x)=0$$
$$f(n)=\sum _{d|n}{d}^k\mu (\frac{n}{d})=(p_1^{k_1-1}{p}_2^{k_2-1}{p}_3^{k_3-1}...p_r^{k_r-1}{)}^k\times f(p_1{p}_2{p}_3...p_r)$$
$$\because \varphi (p_1{p}_2{p}_3...p_r)=(p_1-1)(p_2-1)(p_3-1)...(p_r-1)$$
$$\therefore f(p_1{p}_2{p}_3...p_n)=(p_1^k-1)(p_2^k-1)(p_3^k-1)...(p_r^k-1)$$
综上
$$f(n)=(p_1^{k_1-1}{p}_2^{k_2-1}{p}_3^{k_3-1}...p_r^{k_r-1}{)}^k\times (p_1^k-1)(p_2^k-1)(p_3^k-1)...(p_r^k-1)$$
由于时间限制，预处理出了所有的质数和它们的$k$次幂

#include <cstdio>
#define MOD 998244353
#define N 5000010

typedef long long LL;
using namespace std;

LL pr[N], kp[N], f[N];
int cnt;

int qui_pow(LL x, int y) {
	if (y == 1) return x;
	LL t = qui_pow(x, y / 2);
	if (y % 2 == 0) return t * t % MOD;
	else return t * t % MOD * x % MOD;
}

int main() {
	int m, k;
	scanf("%d%d", &m, &k);
	for (int i = 2; i * i < N; ++i) {
		if (!f[i]) {
			for (int j = 2; i * j < N; ++j) {
				f[i * j] = 1;
			}
		}
	}
	for (int i = 2; i < N; ++i) {
		if (!f[i]) {
			pr[++cnt] = i;
			kp[cnt] = qui_pow(i, k);
		}
	}
	for (int i = 1; i <= m; ++i) {
		LL n, ans = 1, all = 1;
		scanf("%lld", &n);
		for (int i = 1; f[n]; ++i) {
			if (n % pr[i] == 0) {
				n /= pr[i];
				ans = ans * (kp[i] - 1) % MOD;
				while (n % pr[i] == 0) {
					all = all * pr[i] % MOD;
					n /= pr[i];
				}
			}
		}
		if (n > 1) {
			ans = ans * (qui_pow(n, k) - 1) % MOD;
		}
		ans = ans * qui_pow(all, k) % MOD;
		if (ans < 0) ans += MOD;
		printf("%lld\n", ans);
	}
}