Pagini recente » Cod sursa (job #2962797) | Cod sursa (job #1967873) | Cod sursa (job #477653) | Cod sursa (job #1778281) | Cod sursa (job #587575)
Cod sursa(job #587575)
#include<fstream>
using namespace std;
ifstream f("kr.in");
ofstream g("kr.out");
int n,nr_muschii,k=1,T[3]50],H[50],M[3][50];
void citire()
{
f>>n;
while(f>>M[0][k]>>M[1][k]>>M[2][k])
k++;
}
int arb(int nod)
{
while(int nod)
nod=T[nod];
return nod;
}
int main()
{
citire();
k=1;
do
{
while(arb(M[0][k])==arb(M[1][k]))
k++;
nr_muchii++;
g<<M[0][k]<<" "<<M[1][k];
g<<" "<<M[2][k]<<"\n";
if(H[M[0][k]]==H[M[1][k]])
{
T[M[0][k]]=M[1][k];
H[M[1][k]]++;
}
else
if(H[M[0][k]]<H[M[1][k]])
T[M[0][k]]=M[1][k];
else
T[M[1][k]]=M[0][k];
k++;
}
while(nr_muchii<n-1);
return 0;
}