I was wondering what is the number of chess games modulo 2? Is it one, zero or is it impossible to know the answer without knowing the number of chess games itself?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | maomao90 | 161 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 154 |
| 7 | Dominater069 | 154 |
| 9 | awoo | 152 |
| 9 | luogu_official | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/27/2024 21:18:34 (i1).
Desktop version, switch to mobile version.
Supported by
///
The number of chess games is not n*(n-1)/2
How do you know xD?
I don't even know what n represents :D
It is n * (n - 1) / 2 for some n. I guess it won't be integer n.
The number of ways is n for some integer n xD
and the answer is n%2, it's quite easy question :D
Wow. Most retarded comment I ever seen.
Don't forget to count this