Search results
Jump to navigation
Jump to search
Page title matches
- ByteDance - Moscow Workshops Programming Camp 2020. Day 3, Contest 3
- 4 bytes (1 word) - 04:17, 28 March 2020
- Solved by ultmaster. 00:25 (+3)7 KB (195 words) - 06:42, 21 March 2018
- Solved by dreamcloud. 3:00:55(+3) 题意:给你一堆数,$a_1,a_2,……,a_n$,让你在相邻数之间插入$+,-,*$, 总共$3^{n-1}$种填法,问你它们计算出结果之后的累和。每次询问4 KB (136 words) - 10:25, 31 October 2018
Page text matches
- * $\frac{1}{2n} (3d + 3 i x)$ 关键在于字典序最小。显然逐位确定。确定之后对后面的部分进行「乐观估计」,可行才往下搜,这样的 DFS 不会回溯。最短路复杂度 $O(n^3)$,总复杂度是 $O(n^4)$。6 KB (344 words) - 12:30, 1 February 2019
- ...on on 3.13 is postponed until Sunday (3.17) ,and we cancel the training on 3.17. 2019.3.31 SHU Contest3 KB (414 words) - 04:15, 11 June 2019
- ...contest] [[Media:Bapc2017problems.pdf|problems]] [[Media:Bapc2017solutions.pdf|solution]]) team .../100520 contest] [[Media:Asc45problems.pdf|problems]] [[Media:Asc45analysis.pdf|analysis]]) team3 KB (346 words) - 12:34, 26 March 2018
- ...ture 1 (Week 8): Enumerating skills; dynamic programming. (Textbook 2.1, 2.3) * Lecture 3 (Week 10): (Advanced) Data Structures.2 KB (385 words) - 12:59, 14 March 2019
- ! scope="row"|[[ECNU XCPC Team Training Round #3]] |3/85 KB (700 words) - 14:57, 20 March 2021
- ! scope="row"|[[2018 Multi-University,Nowcoder Day 3]] ! scope="row"|[[2018 Multi-University Training Contest 3]]9 KB (1,056 words) - 13:56, 19 December 2018
- |3/112 * ACM-ICPC 2018 Qingdao Online Contest: [[Media:Qingdao2018Online problems.pdf|problems]]27 KB (3,265 words) - 21:59, 4 April 2019
- |2019.11.3 ! scope="row"|[[2016-2017 Codeforces Trainings Season 3 Episode 7(CT S03E07)]]42 KB (5,591 words) - 01:38, 16 November 2022
- 错误二:消环,显然错误,1 2 3 1 4 2 5,答案应该为1 2 5,消环会错误消去1 2 3,结果变为1 4 2 5 错误三:路径输出错误,1 2 3 4 5 2 4 6 7 5,答案应该为1 2 3 4 5,错误答案为1 2 4 510 KB (270 words) - 09:21, 4 October 2018