| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Hi , i need help in this question
Problem statement in short :
Given a tree,every node has a value written on it.
There will be several queries of two types:
1 — update value of any node of tree
2 — tell if the product of values of node on path from u to v is divisble by k
All constraints are of order 10^5.
Editorial is not properly explained.
Thanks
I need help in the problem : problem B — center
Someone please share idea on how to solve it.
Thanks
Can someone please proof how number of permutations of first N natural numbers with no three-term increasing subsequence can be given by the Nth catalan number .. ?
More formally number of permutations such that there doesn't exist any i<j<k for which a[i]<a[j]<a[k].
someone please help me with this problem :
https://www.hackerrank.com/contests/projecteuler/challenges/euler050
https://www.hackerrank.com/contests/101hack41/challenges/the-forest-game
Can someone explain the idea behind this problem?
Editorial is not much clear,lacks proof.
Thanks.
