Pagini recente » Cod sursa (job #2293140) | Cod sursa (job #2191854) | Cod sursa (job #2032106) | Cod sursa (job #266029) | Cod sursa (job #1248515)
#include <iostream>
using namespace std;
const int NMAX = 1024;
struct PAIR {
int x,y;
};
PAIR sol[NMAX+2];
int N, v[NMAX+2][NMAX+2];
int tt[NMAX+2], gr[NMAX+2];
int root( int x ) {
if ( tt[x] == x ) return x;
else return ( tt[x] = findy( tt[x] ) );
}
citire_init() {
in >> N;
for( int i= 1; i<N; ++i ) {
tt[i]= i; gr[i]= 1;
for( int j= i+1; j<=N; ++j ) in >> v[i][j];
}
}
int main() {
citire_init();