Pagini recente » Cod sursa (job #1359869) | Cod sursa (job #316460) | Cod sursa (job #1785596) | Cod sursa (job #844229) | Cod sursa (job #1436070)
#include <iostream>
#include<fstream>
using namespace std;
const int infinit=1.e20;
int n,s[50],i,j,k,c,lin,col;
float mini,C[50][50];
ofstream g("apm.out");
void citesc()
{
ifstream f("apm.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i==j) C[i][j]=0;
else
C[i][j]=C[j][i]=infinit;
while(f>>i>>j>>c)
C[i][j]=C[j][i]=c;
f.close();
}
int main()
{
citesc();
s[1]=1;
for(k=1;k<=n-1;k++)
{
mini=infinit;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(s[i]==1 && s[j]==0 && mini>C[i][j])
{
mini=C[i][j];
lin=i;col=j;
}
g<<lin<<" "<<col<<" "<<mini<<endl;
s[col]=1;
}
return 0;
}