HDU 6189 and Happy Equation

题目大意：给定$n$和$a$,令$m=2^n$,求$b\in [1,m]$且满足$a^b\equiv b^a(mod$ $m)$的$b$个数

打表可以得出当$a$为奇数时，$sum=1$
当$a$为偶数时，$a^b$为偶数，又因为$m$为偶数，所以$a^b\%m$也是偶数，$a^b\%m=b^a\%m$，同理$b$为偶数
令$a=2\ast x$，$a^b\%m=2^b\ast x^b\%m$，即$a^b\%m=2^b\ast x^b\%2^n$
当$b\le n$时，因为$n\le 30$，暴力即可
当$b>n$时，$2^b\ast x^b\%2^n=0$，即$a^b\%m=0$，即$b^a\%m=0$，现在就是求使$b^a\%m=0$成立的$b$的个数
因为$b$为偶数，$b=2^x\ast y$，令$c=y^a$，即$2^{ax}\ast c\%2^n=0$，当$ax\ge n$时，恒成立，即$x\ge \lceil \frac{n}{a}\rceil$，令$x=\lceil \frac{n}{a}\rceil$，此时$b=2^{\lceil \frac{n}{a}\rceil }\ast y$，符合$b^a\%m=0$，且当$y=1$时，$b$最小，现在从$(n,m]$中查找$2^{\lceil \frac{n}{a}\rceil }|b$的个数，即$(m>>x)-(n>>x)$，为什么会这样呢，其实就是找$y_{max}-y_{min}$，即$\lceil \frac{m}{2^x}\rceil -\lceil \frac{n}{2^x}\rceil$……

唉，好累……

//#include <bits/stdc++.h>
#include <iostream>
#define IOS ios::sync_with_stdio(false);cin.tie(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const int INF = 0x7f7f7f7f;
const int MAXN = 105;

ll quickpow(ll a, ll b, int mod) {
	if (!b) return 1 % mod;
	ll ans = 1;
	while (b) {
		if (b & 1)
			ans = ans * a % mod;
		b >>= 1;
		a = a * a % mod;
	}
	return ans;
}

int main() {
	IOS;
	ll a, n;
	while (~scanf("%lld%lld", &n, &a)) {
		ll sum = 0;
		if (a & 1) {
			cout << 1 << endl;
			continue;
		}
		int m = 1 << n;
		for (int b = 2; b <= n; b += 2) {
			if (quickpow(a, b, m) == quickpow(b, a, m))
				sum++;
		}
		int x = ceil(double(n) / a);
		sum += (m >> x) - (n >> x);
		cout << sum << endl;
	}
	return 0;
}

https://zoj.pintia.cn/problem-sets/91827364500/problems/91827370518

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const int INF = 0x7f7f7f7f;
const int MAXN = 105;

ll quickpow(ll a, ll b, int mod) {
	if (!b) return 1 % mod;
	ll ans = 1;
	while (b) {
		if (b & 1)
			ans = ans * a % mod;
		b >>= 1;
		a = (a % mod * a % mod) % mod;
	}
	return ans;
}

int main() {
	IOS;
	int T;
	cin >> T;
	while (T--) {
		ll a, p;
		cin >> a >> p;
		ll sum = 0;
		if (a & 1) {
			cout << 1 << endl;
			continue;
		}
		int m = 1 << p;
		for (int b = 2; b <= p; b += 2) {
			if (quickpow(a, b, m) == quickpow(b, a, m))
				sum++;
		}
		int x = ceil(double(p) / a);
		sum += (m >> x) - (p >> x);
		cout << sum << endl;
	}
	return 0;
}