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
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ 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-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/06/2026 11:32:39 (g2).
Desktop version, switch to mobile version.
Supported by
