|Online Judge||Problem Set||Authors||Online Contests||User|
Edges and More Edges
What is the maximum number of edges in an undirected graph G of n vertices that avoids a k-matching? Note that loops and parallel edges are not allowed in the graph.
The input contains several test cases.
For each test case output the maximum number of edges.
1000 1 500 2 0 0
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator