How to solve http://codeforces.net/contest/242/problem/E problem with square root decompositatio?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 158 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
You are given a tree,number X and each node have a number on it.You have to find some nodes a1,a2,a3 ... ,an such a2 is child of a1 ,a3 is child of a2,...an is child of an - 1 and a1 + a2 + ... + an closest number to X.We say x is child of y if it's in subtree with root in y. This problem was on Serbian state competition 2014. for seniors,could you give me any hints or pseudocode?
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/23/2025 01:16:36 (j2).
Desktop version, switch to mobile version.
Supported by
