# UVa 11597

Jump to navigation
Jump to search

Divide the input integer by two, then output it as the answer. proof:

While you have n vertex and n*(n-1) edges, each total number edges of spanngin tree is n-1. then you can have at most n*(n-1)/2/(n-1)=>n/2 numbers of such a tree.