### PROBLEM LINK:

**Author:** Trung Nguyen

**Tester:** Oleksandr Kulkov

**Editorialist:** Oleksandr Kulkov

### DIFFICULTY:

MEDIUM

### PREREQUISITES:

None

### PROBLEM:

n players participated in tournaments. Each player compete with each other once. Winner earns 1 point, loser earns 0 points. After the tournament player that won g_i games is awarded by g_i^2 money. You have to check if it is possible that overall earns of players equals k.

### QUICK EXPLANATION:

TODO

### EXPLANATION:

First thing we should look at is the fact that sum of points earned by all players equals \dfrac{n(n-1)}{2}. TODO

### AUTHOR’S AND TESTER’S SOLUTIONS:

Author’s solution can be found [here][333].

Tester’s solution can be found [here][444].

### RELATED PROBLEMS:

[333]: The link is provided by admins after the contest ends and the solutions are uploaded on the CodeChef Server.

[444]: The link is provided by admins after the contest ends and the solutions are uploaded on the CodeChef Server