HDU - 4990

n 为奇数时:
f(1)=(01)_B=1 f(2)=(101)_B=5 f(3)=(10101)_B=21……
f(n) = 2⁰+2²+2⁴+…+2^n-1 = 4⁰+4¹+4²+…+4^(n-1)/2 = (2ⁿ⁺¹-1)/3;

n为偶数时:
f(1)=(10)_B=2 f(2)=(1010)_B=10 f(3)=(101010)_B=42……
f(n)=2¹+2³+2⁵+…+2^n-1=2(4⁰+4¹+4²+…+4^(n-1)/2)=(2ⁿ⁺¹-2)/3;

存一个带除法取模的公式orz
a/b%m=a%bm/b

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 8;
const int inf = 0x3f3f3f3f;

ll ff(ll x, ll y, ll mod)
{
	ll ans = 1;
	while(y)
	{
		if(y & 1)
			ans = ans * x % mod;
		x = x * x  % mod;
		y >>= 1; 
	}
	return ans;
}

int main()
{
	ll n, m;
	while(~scanf("%lld%lld", &n, &m))
	{
		if(n & 1)
			printf("%lld\n", (ff(2, n + 1, 3 * m) - 1) / 3);
		else
			printf("%lld\n", (ff(2, n + 1, 3 * m) - 2) / 3);
	}
}