https://ac.nowcoder.com/acm/contest/549/C
思路:dp[i][j]表示取i张总和为j的方案数;
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e6+9;
const int mod=1e9+7;
template <class T>
inline void sc(T &ret)
{
char c;
ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9')
{
ret = ret * 10 + (c - '0'), c = getchar();
}
}
ll power(ll x,ll n)
{
ll ans=1;
while(n)
{
if(n&1) ans=ans*x;
n>>=1;
x=x*x;
}
return ans;
}
ll dp[40][400];
int main()
{
FASTIO;
int n;
cin>>n;
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=i;j<=120;j++)
{
for(int k=1;j>=k&&k<=4;k++)
{
dp[i][j]+=dp[i-1][j-k];
}
}
}
ll mu=power(4,n);
ll zi=0;
for(int i=3*n;i<=4*n;i++)
{
zi+=dp[n][i];
}
ll g=gcd(zi,mu);
zi/=g;
mu/=g;
cout<<zi<<"/"<<mu<<endl;
return 0;
}