这个只需在原来的连接表的代码的基础上改几个代码,你能发现是改哪里么?
#include<iostream>
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
vector<int>scorevector;
int main()
{
int max,i,num,c,j;
int*a;
a=new int[max];
ifstream tinyDG;
tinyDG.open("C:\\Users\\caiminghai\\Desktop\\tinyDG.txt");
while(!tinyDG.eof())
{
tinyDG>>num;
scorevector.push_back(num);
}
tinyDG.close();
max=scorevector.size();
for( i=0;i<scorevector.size();i++)
{a[i]=scorevector[i];}
for(c=0,i=0;i<scorevector.size()/2-1;i++,c++)
{
if (a[2*i+3]==c);
{
if(c<a[0])
cout<<c<<":";
}
for( j=0;j<scorevector.size()/2-1;j++)
{
if(a[2*j+3]==c)
{int p=0;
int d[10];
d[p]=a[2*j+2];
cout<<d[p]<<" ";
p++;}
}
cout<<endl;
}
return 0;
}
原图