Minimum Spanning Tree by murky-satyr

m=[:]
System.in.readLines().sort{it-~/.+ /as int}.any{(a,b)=it.split().collect{m[it]?:[it]}
println"${Set x=a+b;b==x.each{m[it]=x}?'F':'T'} $it"}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page