I was wondering a problem: Is it possible to construct a n*n matrix (call it A) such that each number from 0 to n-1 appears exactly n times and the result of A*A is a zero matrix. I know it is obvious for odd n but how about even n?
→ Pay attention
→ Streams
→ 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 | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en10 |
|
anothermousey | 2023-01-24 18:10:52 | 8 | ||
| en9 |
|
anothermousey | 2023-01-24 18:10:13 | 0 | (published) | |
| en8 |
|
anothermousey | 2023-01-24 18:09:59 | 2 | (saved to drafts) | |
| en7 |
|
anothermousey | 2023-01-24 16:50:28 | 0 | (published) | |
| en6 |
|
anothermousey | 2023-01-24 16:50:09 | 2 | ||
| en5 |
|
anothermousey | 2023-01-24 14:42:32 | 1555 | (saved to drafts) | |
| en4 |
|
anothermousey | 2023-01-12 12:14:08 | 24 | Tiny change: 'lt of A*A is a zero' -> 'lt of A*A (matrix multiplication) is a zero' | |
| en3 |
|
anothermousey | 2023-01-12 12:09:40 | 4 | Tiny change: 'mber from 0 to n-1 appears e' -> 'mber from 1 to n appears e' | |
| en2 |
|
anothermousey | 2023-01-12 12:00:32 | 44 | ||
| en1 |
|
anothermousey | 2023-01-12 11:24:31 | 261 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 05:31:10 (j2).
Desktop version, switch to mobile version.
Supported by
