Given a graph of $$$N$$$ nodes . There is a directed edge from node i to node j $$$1)\ \A[i] >\ A[j]$$$
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Sum of nearest prime distances
Given a graph of $$$N$$$ nodes . There is a directed edge from node i to node j $$$1)\ \A[i] >\ A[j]$$$
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en24 |
![]() |
harsha314 | 2021-08-08 19:17:38 | 0 | (published) | |
en23 |
![]() |
harsha314 | 2021-08-08 19:17:17 | 81 | ||
en22 |
![]() |
harsha314 | 2021-08-08 19:16:27 | 17 | ||
en21 |
![]() |
harsha314 | 2021-08-08 19:15:33 | 28 | ||
en20 |
![]() |
harsha314 | 2021-08-08 19:14:46 | 120 | ||
en19 |
![]() |
harsha314 | 2021-08-08 19:12:25 | 8 | Tiny change: '=\ [1,2,4]\newline$\n$B = [0' -> '=\ [1,2,4]$\n$B = [0' | |
en18 |
![]() |
harsha314 | 2021-08-08 19:11:45 | 38 | ||
en17 |
![]() |
harsha314 | 2021-08-08 19:10:33 | 12 | ||
en16 |
![]() |
harsha314 | 2021-08-08 19:10:10 | 110 | ||
en15 |
![]() |
harsha314 | 2021-08-08 19:08:17 | 9 | ||
en14 |
![]() |
harsha314 | 2021-08-08 19:07:33 | 3 | Tiny change: ':\n\n$1\leK\leN\ \le\ 10^5\newl' -> ':\n\n$1\le K\le N\ \le 10^5\newl' | |
en13 |
![]() |
harsha314 | 2021-08-08 19:07:09 | 7 | Tiny change: '> :\n\n$1\ \le\ K\ \le N\ \le\ 10' -> '> :\n\n$1\leK\leN\ \le\ 10' | |
en12 |
![]() |
harsha314 | 2021-08-08 19:06:41 | 7 | Tiny change: '\le\ 10^5\ $\n$\ B[i' -> '\le\ 10^5\newline $\n$\ B[i' | |
en11 |
![]() |
harsha314 | 2021-08-08 19:06:23 | 8 | Tiny change: 'e\ 10^6\ \tab\forall\ 1' -> 'e\ 10^6\ \ \ \ \forall\ 1' | |
en10 |
![]() |
harsha314 | 2021-08-08 19:05:26 | 9 | ||
en9 |
![]() |
harsha314 | 2021-08-08 19:04:38 | 15 | Tiny change: '<b> :\n\n$N\ \le\ 10' -> '<b> :\n\n$1\ \le\ K\ \le N\ \le\ 10' | |
en8 |
![]() |
harsha314 | 2021-08-08 19:03:50 | 11 | Tiny change: '\ 7$ .\n\nConstraints : $N\ \le\ 1' -> '\ 7$ .\n\n<b>Constraints<b> :\n\n$N\ \le\ 1' | |
en7 |
![]() |
harsha314 | 2021-08-08 19:03:18 | 2 | Tiny change: '10^6\ \forAll\ 1\ \le' -> '10^6\ \forall\ 1\ \le' | |
en6 |
![]() |
harsha314 | 2021-08-08 19:02:57 | 28 | Tiny change: ' \le\ 10^6$' -> ' \le\ 10^6\ \forAll\ 1\ \le\ i\ \le\ N$' | |
en5 |
![]() |
harsha314 | 2021-08-08 19:01:42 | 52 | Tiny change: '9\ +\ 7$ .' -> '9\ +\ 7$ .\n\nConstraints : $N\ \le\ 10^5\ ;\ B[i]\ \le\ 10^6$' | |
en4 |
![]() |
harsha314 | 2021-08-08 19:00:20 | 245 | ||
en3 |
![]() |
harsha314 | 2021-08-08 18:53:04 | 14 | Tiny change: 'to node j \n$1\)\ \A[i] \>\ A[j]$ ' -> 'to node j if $A[i]\ >\ A[j]$ .' | |
en2 |
![]() |
harsha314 | 2021-08-08 18:52:28 | 1 | Tiny change: 'ode j \n$1)\ \A[i] \' -> 'ode j \n$1\)\ \A[i] \' | |
en1 |
![]() |
harsha314 | 2021-08-08 18:52:08 | 129 | Initial revision (saved to drafts) |
Name |
---|