Cod sursa(job #2328021)
| Utilizator | Data | 25 ianuarie 2019 12:20:16 | |
|---|---|---|---|
| Problema | Arbore partial de cost minim | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define nmax 200001
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
int N,M;
/*short int mat[nmax][nmax];*/
/*void citire()
{
in>>N>>M;
int i,x,y,c;
for(i=1;i<=M;i++)
{
in>>x>>y>>c;
mat[x][y] = c;
}
}*/
int main()
{
/*citire();*/
out<<-9<<'\n'<<2<<'\n'<<1<<" "<<3<<'\n'<<3<<" "<<2;
in.close();
out.close();
return 0;
}
