UVA 10733 - The Colored Cubes【Polya定理】

The Colored Cubes

Time Limit: 3000MSMemory Limit: Unknown

      All 6 sides of a cube are to be coated with paint. Each side is is coated uniformly with one color. When a selection of n different colors of paint is available, how many different cubes can you make?

     Note that any two cubes are only to be called “different” if it is not possible to rotate the one into 

such a position that it appears with the same coloring as the other.

Input：

Each line of the input file contains a single integer n (0 < n < 1000) denoting the number of different colors. Input is terminated by a line where the value of n = 0. This line should not be processed.

Output：

For each line of input produce one line of output. This line should contain the number of differentcubes that can be made by using the according number of colors.

Sample Input：

1

2

0

Sample Output：

1

10

#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <string.h>
using namespace std;
typedef long long ll;
int n;

ll solve(int z)
{
    ll ans = 1;
    for(int i = 0; i < z; i++)
        ans *= n;
    return ans;
}

ll polya()
{
    ll sum = 0;
    sum += solve(6) + (2 * 3 * solve(3) + 3 * solve(4)) + 2 * 4 * solve(2) + 2 * 3 * solve(3);
    return sum;
}

int main()
{
    while(~scanf("%d",&n))
    {
        if(n == 0)
            break;
        printf("%lld\n",polya()/24);
    }
    return 0;
}