wuzhibin

摘要： /*This Code is Submitted by billforum for Problem 1460 at 2012-02-15 17:20:22*/#include <iostream>#include <stdio.h>#include <map>#include <cmath>#include <algorithm>using namespace std;const int N=205;const int Max=20000;int n,ns;int a[N],d[N][N],total;bool f[N];int mi 阅读全文

摘要： /*This Code is Submitted by billforum for Problem 1751 at 2012-02-15 12:44:59*/#include <iostream>#include <stdio.h>#include <map>#include <cmath>#include <algorithm>using namespace std;const int N=600;const double Max=20000;int n;double a[N],d[N][N],total;bool f[N];voi 阅读全文

摘要： #include <iostream>#include <stdio.h>#include <cmath>#include <algorithm>using namespace std;const int N=105;const int Max=20000;int n;double a[N],d[N][N],total;bool f[N];struct point{ double x,y;}p[N];double dist(point p1,point p2){ return(sqrt((double)(p1.x-p2.x)*(p1.x-p2.x 阅读全文

摘要： #include <iostream>#include <stdio.h>#include <cstring>using namespace std;const int N=2005;const int Max=100;int f[N],a[N],d[N][N];int n,total;string str[N];int diff(string str1,string str2){ int num=0; for(int i=0;i<str1.size();i++) if(str1[i]!=str2[i]) num++; return num;}void 阅读全文