I was wondering a problem: Is it possible to construct a n*n matrix (call it A) such that each number from 1 to n appears exactly n times and the result of A*A is a zero matrix (after modulo n*n terms in the matrix by n). I know it is obvious for odd n but how about even n?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
→ 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: Nov/13/2024 05:55:29 (l3).
Desktop version, switch to mobile version.
Supported by
