uva11255 Necklace

对旋转和翻折操作，根据奇偶性大力讨论出不动点个数。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
const int maxn=40;
LL C[maxn+5][maxn+5];
int gcd(int x,int y)
{
    return y?gcd(y,x%y):x;
}
void solve()
{
    int a,b,c,n,x;
    LL ans=0;
    scanf("%d%d%d",&a,&b,&c);
    n=a+b+c;
    for (int i=0;i<n;i++)
    {
        x=n/gcd(i,n);
        if (a%x==0&&b%x==0&&c%x==0)
            ans+=C[n/x][a/x]*C[n/x-a/x][b/x];
    }
    if (n&1)
    {
        if ((a&1)+(b&1)+(c&1)==1)
            ans+=n*C[n/2][a/2]*C[n/2-a/2][b/2];
    }
    else
    {
        if ((a&1)+(b&1)+(c&1)==0)
            ans+=n*C[n/2][a/2]*C[n/2-a/2][b/2];
        else
            ans+=n*C[n/2-1][a/2]*C[n/2-1-a/2][b/2];
    }
    printf("%lld\n",ans/n/2);
}
int main()
{
    int T;
    for (int i=0;i<=maxn;i++) C[i][0]=1;
    for (int i=0;i<=maxn;i++)
        for (int j=1;j<=i;j++)
            C[i][j]=C[i-1][j]+C[i-1][j-1];
    scanf("%d",&T);
    while (T--) solve();
}