StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Given a graph G = (V, E) prove e <= n(n-1)/2 for all n
| Author | Votes | Δ |
|---|---|---|
| MT0 | 0 | 0.00 |
Last visited: Apr 19, 2016, 10:53:29 PM
| Author | Votes | Δ |
|---|---|---|
| MT0 | 0 | 0.00 |