等比数列求和模板

#define mod ....//随便填
int qpow(int n, int m) {
	int ans = 1;
	while (m) {
		if (m & 1)ans *= n, ans %= mod;
		m /= 2; n *= n; n %= mod;
	}
	return ans;
}
int ers(int q, int n) {
	if (n == 0)return 1;
	if (n % 2 != 0)return (ers(q, n / 2) * (1 + qpow(q, n / 2 + 1))) % mod;
	else return (ers(q, n / 2 - 1) * (1 + qpow(q, n / 2 + 1)) + qpow(q, n / 2)) % mod;
}