×

# WEICOM - Editorial

Author: Trung Nguyen
Tester: Oleksandr Kulkov
Editorialist: Oleksandr Kulkov

MEDIUM

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$.

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

This question is marked "community wiki".

4★melfice
811637
accept rate: 0%

19.6k349497539

 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×2,503
×64

question asked: 24 Oct '17, 06:42

question was seen: 87 times

last updated: 10 Aug, 16:28