摘要：题目：USACONOCOW结果：代码：#include<fstream>using namespace std;struct Map{ int length; bool intree;};int length,total,Arc[100][100];Map a[100];int findTheShortest(){ int i,j,shortest=1000000; for(i=0;i<total;i++) if(a[i].intree==false&&a[i].length<shortest) {shortest=a[i].length; ... 阅读全文

摘要：题目：①、USACO ②、NOCOW注意： ①、两个农场之间可能多条路径，并且长度不同； ②、无向图；代码：#include<stdio.h>#include<assert.h>int main(){ FILE *fin,*fout; fin=fopen("comehome.in","r"); fout=fopen("comehome.out","w"); assert(fin); assert(fout); int Arc[58][58]; int pathNum,i,j,k,length 阅读全文

摘要：题目：http://ace.delos.com/usacoprob2?a=JLwu8ZOtbGJ&S=maze1 http://www.nocow.cn/index.php/Translate:USACO/maze1#include<iostream>#include<fstream>#include<queue>using namespace std;struct Node{ int num; int link[4];};int main(){ //ifstream fin("1.txt"); //ofstream fout(& 阅读全文

摘要：officeMS officeopen officeLibre officeWps officePDFSumatra PDF (1M) 阅读全文