hdu 4712 Hamming distance

不知道正解是神马，，不过网上都是这种随机破法，，也只好随大流了。。

#include<cstdio>  
#include<cstring>  
#include<iostream>  
#include<ctime>  
#include<cstdlib>  
using namespace std;  
  
int cmp[16][16];  
  
char data[1000005][6];  
  
int fun(int q,int w)  
{  
    int a,b;  
    int ret = 0;  
    for(int i=0;i<5;i++)  
    {  
        char x = data[q][i];  
        char y = data[w][i];  
        if(x>='0' && x<='9')  
            a=x-'0';  
        else  
            a=x-'A'+10;  
  
        if(y>='0' && y<='9')  
            b=y-'0';  
        else  
            b=y-'A'+10;  
  
        ret += cmp[a][b];  
    }  
    return ret;  
}  
  
int main()  
{  
    for(int i=0;i<=15;i++)  
    {  
        for(int j=0;j<=15;j++)  
        {  
            int ans=0;  
            int tmp = i^j;  
            for(int k=0;k<4;k++)  
                if((1<<k) & tmp)  
                    ans++;  
            cmp[i][j] = ans;  
        }  
    }  
  
    int n;  
    int t;  
    scanf("%d",&t);  
    while(t--)  
    {  
        scanf("%d",&n);  
        for(int i=1;i<=n;i++)  
            scanf("%s",data[i]);  
  
        int ans = 0x3f3f3f3f;  
        srand( (unsigned)time( NULL ) );  
        for(int i=1;i<=100000;i++)  
        {  
            int a = rand()%n+1;  
            int b = rand()%n+1;  
            if(a==b)  
                b = b%n+1;  
            int tmp = fun(a,b);  
            if(tmp < ans)  
                ans = tmp;  
        }  
        cout<<ans<<endl;  
    }    
    return 0;  
}  

暴力 100点 求最小三角形面积

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<cmath>
#include<iomanip>
#define INF 99999999
using namespace std;

const int MAX=100+10;
double s[MAX][2];

double calculate(int i,int j,int k){
	return fabs((s[j][0]-s[i][0])*(s[k][1]-s[i][1])-(s[k][0]-s[i][0])*(s[j][1]-s[i][1]))/2;
}

int main(){
	int t,n;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(int i=0;i<n;++i)scanf("%lf%lf",&s[i][0],&s[i][1]);
		double sum=INF*1.0;
		for(int i=0;i<n;++i){
			for(int j=i+1;j<n;++j){
				for(int k=j+1;k<n;++k){
					if(s[i][1] == s[j][1] && s[j][1] == s[k][1])continue;
					if((s[j][1]-s[i][1])/(s[j][0]-s[i][0]) == (s[k][1]-s[j][1])/(s[k][0]-s[j][0]))continue;
					sum=min(sum,calculate(i,j,k));
				}
			}
		}
		if(sum == INF*1.0)printf("Impossible\n");
		else printf("%.2lf\n",sum);
	}
	return 0;
}