hdu 4712 Hamming Distance（随机数法）

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
using namespace std;

int main(){

    //cout<<RAND_MAX<<endl;//32767

    int T;
    int N;
    char str[100005][10];
    int num[100005];
    int i;
    int j;
    int mi;
    int fuck;
    int shit;
    int tmp;
    int sum;

    scanf("%d",&T);

    while(T--){
        scanf("%d",&N);
        for(i=0;i<N;++i){
            scanf("%s",str[i]);
        }

        memset(num,0,sizeof(num));
        for(i=0;i<N;++i){
            for(j=0;j<5;++j){
                if(‘0‘<=str[i][j]&&str[i][j]<=‘9‘){
                    num[i]=(num[i]<<4)+(str[i][j]-‘0‘);
                }
                else{
                    num[i]=(num[i]<<4)+(10+str[i][j]-‘A‘);
                }
            }
        }

        mi=21;
        srand(time(NULL));
        for(i=0;i<400005;++i){
            fuck=(rand()*rand())%N;//这是个看脸的代码。。。
            shit=(rand()*rand())%N;

            if(fuck==shit){
                continue;
            }
            tmp=num[fuck]^num[shit];
            sum=0;
            while(tmp>0){
                sum=sum+(tmp&1);
                tmp>>=1;
            }
            if(sum<mi){
                mi=sum;
            }
        }

        printf("%d\n",mi);

    }

    return 0;
}