| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 153 |
| 9 | awoo | 152 |
| 10 | luogu_official | 150 |
How to solve this google coding round problem?
Given an undirected graph with n nodes rooted at node 1. In this graph for each node we've to find the number of predecessors in the path from root to this node. Any ideas?
let's say the graph is like this
1
/ \
2 4
\ /
3
Here for node 3 predecessors are 2 and 4
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
destiny____ | 2021-11-08 20:06:34 | 2 | Tiny change: 'irected **weighted**' -> 'irected **unweighted**' | |
| en6 |
|
destiny____ | 2021-11-08 20:01:55 | 154 | ||
| en5 |
|
destiny____ | 2021-11-08 19:59:22 | 17 | ||
| en4 |
|
destiny____ | 2021-11-08 19:58:45 | 13 | Tiny change: 'rs in the path from root to t' -> 'rs in the shortest path from the root to t' | |
| en3 |
|
destiny____ | 2021-11-08 19:58:12 | 11 | Tiny change: 'let's say graph is ' -> 'let's say the graph is ' | |
| en2 |
|
destiny____ | 2021-11-08 19:57:32 | 222 | ||
| en1 |
|
destiny____ | 2021-11-08 19:54:53 | 230 | Initial revision (published) |
