URAL 1932 The Secret of Identifier 题解

http://acm.timus.ru/problem.aspx?space=1&num=1932

B - The Secret of Identifier
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit Status Practice URAL 

Description
Davy Jones: You've been captain of the Black Pearl for 13 years. That was our agreement.
Jack: Technically I was only captain for two years, then I was mutinied upon.
Davy Jones: Then you were a poor captain, but a captain nonetheless. Have you not introduced yourself as Captain Jack Sparrow?
According to the Pirate Code, each of the pirates of the Caribbean at the beginning of their professional career (hereditary pirates –– at birth) is assigned by a unique identifier. Pirate's identifier is a string of four hexadecimal digits. However, it is not a usual row of numbers, it is said that personal qualities and life path of its owner are encoded in it by a mysterious way. But no one still could guess this mystical connection.
Once Captain Jack Sparrow, while sitting in captain’s cabin, decided to try to find the way to derive some data about a pirate using the identifier. Memories about how he lost the Black Pearl last time gave him the idea that more similar identifiers of two pirates are, bigger chances for these pirates to unite against the Captain, and, as a result, to make a mutiny. The Captain Jack Sparrow, of course, doesn’t want to have the mutiny on his ship, but he chose the new team this time and it is going to be a long voyage. Now Jack needs to estimate the opportunities of raising the mutiny on his ship, based on the conclusions. For this aim he first wants to know for each pair of pirates a number of positions in their identifiers in which they are different.

Input
The first line contains an integer n –– the number of pirates aboard the Black Pearl ( ≤ n ≤ ). Each of the following n lines contains four-digit identifier of the respective pirate. Only decimal digits and lowercase Latin letters from “a” to “f” inclusive are used in writing identifiers. Identifiers of all pirates are different.

Output
Output four space separated integers –– the amount of pairs of pirates, which have different identifiers exactly in one, two, three and four positions respectively.

Sample Input
input    output

dead
beef
f00d

题目（格式混乱，请点击上面链接查看原题）

给n个不同的4位十六进制数，两两按位比较，输出有1位不同的、两位不同的、3位不同的、4位不同的组合的个数。（输出4个数）

先弄15个4位十六进制数，像掩码之类的一样，虽然我也不懂掩码具体是怎么弄的。比如现在用的是0F0F，和输入的那些数按位与(&)一下，得到数x，把a[x]++，最后统计a[i]>1的就是0F0F这两个F的位置相同的数的个数，然后这有2个F，就把代表2个相同的t[2]+=a[i]*(a[i]-1)/2;

好像有点说不清楚，不过就是这样！

掩码和F的数量可以开始先打好表，也可以每次算一下，我是先打好表的。

 //最终版本，我哭了
 #include<cstdio>
 #include<cstring>
 typedef long long ll;
 const ll MAXN=;
 const ll psn=;
 const ll ps[psn]= {0x000f,0x00f0,0x00ff,0x0f00,0x0f0f,0x0ff0,0x0fff,0xf000,
                    0xf00f,0xf0f0,0xf0ff,0xff00,0xff0f,0xfff0,0xffff};
 const ll pa[psn]= {,,,,,,,,,,,,,,};
 ll t[MAXN],a[MAXN],ans[];
 ll C(ll a,ll b){
     ll re=;
     for(ll i=;i<b;i++){
         re=re*(a-i)/(i+);
     }
     return re;
 }

 int main()
 {
     int i,j,n;
     while(scanf("%d",&n)!=EOF)
     {
         memset(ans,,sizeof(ans));
         for(i=; i<n; i++)
             scanf("%x",&a[i]);
         for(i=; i<psn; i++)
         {
             memset(t,,sizeof(t));
             for(j=; j<n; j++)
                 t[a[j]&ps[i]]++;
             for(j=; j<=0xffff; j++)
                 ans[pa[i]]+=t[j]*(t[j]-)/;
         }
         for(i=; i>; i--)
             for(j=;j<i;j++)
                 ans[j]-=C(i,j)*ans[i];
         ans[]=C(n,)-ans[]-ans[]-ans[];
         printf("%I64d %I64d %I64d %I64d\n",ans[],ans[],ans[],ans[]);
     }
     return ;
 }