摘要:
简单题,类似高精度View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define maxn 12char num1[maxn], num2[maxn];int main(){ //freopen("t.txt", "r", stdin); while (1) { scanf("%s%s&quo 阅读全文
posted @ 2011-05-20 13:38
undefined2024
阅读(210)
评论(0)
推荐(0)
摘要:
最小生成树View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>using namespace std;#define maxn 105struct Point{ double x, y;} point[maxn];double cost[maxn][maxn];int n;double dis(int a, int b){ return sqrt((point[a].x - point[b]. 阅读全文
posted @ 2011-05-20 13:11
undefined2024
阅读(192)
评论(0)
推荐(0)