Cod sursa(job #1445619)
Utilizator | Data | 30 mai 2015 15:58:28 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
bool cmp()
{
}
int main()
{
in>>n>>m;
for(i=1;i<=n;i++) tata[i]=i;
{
}
in.close();
out.close();
return 0;
}