02 2014 档案

HDUOJ --2544最短路（基础）
摘要：输入包括多组数据。每组数据第一行是两个整数N、M（N 2 #include 3 const int inf=0x3f3f3f3f ; 4 int path[101]; 5 int sta[101][101],lowcost[101]; 6 void Dijkstra( int cost[][101], int n ) 7 { 8 int i,j,min; 9 int vis[101]={1};10 for(i=0; i#include#include#include#includeusing namespace std;const int inf=0x3f3f3f3f;... 阅读全文

posted @ 2014-02-28 23:32 龚细军 阅读(374) 评论(0) 推荐(0) 编辑

帮同学的忙，随意写了个课程设计（关于循环双向列表）
摘要：1 /* 双向循环链表c++版 */ 2 /* Gxjun coder */ 3 #include 4 #define type int // 5 using namespace std; 6 7 typedef struct Node 8 { 9 type inf; // 10 struct Node* pre ; // 11 struct Node* next ; // 12 }node ; 13 14 /*创建，插入，删除，打印*/ 15 16 void c... 阅读全文

posted @ 2014-02-27 21:01 龚细军 阅读(253) 评论(0) 推荐(0) 编辑

HDUOJ---3371Connect the Cities
摘要：Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7997Accepted Submission(s): 2267Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but m 阅读全文

posted @ 2014-02-26 23:29 龚细军 阅读(282) 评论(0) 推荐(0) 编辑

HDUOJ----1301 Jungle Roads
摘要：Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3968Accepted Submission(s): 2888Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages 阅读全文

posted @ 2014-02-26 14:21 龚细军 阅读(298) 评论(0) 推荐(0) 编辑

如何在自己电脑上查看局域网使用的人数？
摘要：常用的方法是使用 CMD =》net view 命令..... 阅读全文

posted @ 2014-02-26 12:11 龚细军 阅读(302) 评论(0) 推荐(0) 编辑

try语句...
摘要：#include#includeusing namespace std;int main( ){ try { throw "嗨 ！ 我引发了一个异常！"; cout<<"正常执行 1"<<endl; } catch(const char* s) { cout<<s<<endl; cout<<"异常类型 ： int"<<endl; } catch(int i) { cout<<i<<endl; cout<<"异常类型： 阅读全文

posted @ 2014-02-25 14:02 龚细军 阅读(184) 评论(0) 推荐(0) 编辑

HDUOJ---1233还是畅通工程
摘要：还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22101Accepted Submission(s): 9871Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用 阅读全文

posted @ 2014-02-25 13:44 龚细军 阅读(167) 评论(0) 推荐(0) 编辑

HDUOJ---1863畅通工程
摘要：畅通工程Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13865Accepted Submission(s): 5732Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第 阅读全文

posted @ 2014-02-25 13:29 龚细军 阅读(273) 评论(0) 推荐(0) 编辑

HDUOJ---1879 继续畅通工程
摘要：继续畅通工程Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11473Accepted Submission(s): 5026Problem Des... 阅读全文

posted @ 2014-02-24 21:56 龚细军 阅读(205) 评论(0) 推荐(0) 编辑

HDUOJ---1102Constructing Roads
摘要：Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12173Accepted Submission(s): 4627Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文

posted @ 2014-02-24 19:10 龚细军 阅读(183) 评论(0) 推荐(0) 编辑

HDUOJ---1102Constructing Roads
摘要：Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12173Accepted Submission(s): 4627Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文

posted @ 2014-02-24 19:09 龚细军 阅读(185) 评论(0) 推荐(0) 编辑

hdu--DFS
摘要：DFSTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4422Accepted Submission(s): 2728Problem DescriptionA DFS(digital factorial sum) number is found by summing the factorial of every digit of a positive integer.For example ,consider the positive inte 阅读全文

posted @ 2014-02-24 14:30 龚细军 阅读(280) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示