Common Board @ Timus Online Judge

Subject	Author	Problem	Updated	Answers
Solution is very intuitive.	Mahilewets	2095. Scrum	2 Jan 2021 20:06	1
WA #7	Deepesson	1476. Lunar Code	2 Jan 2021 00:25	2
Case #4	Deepesson	1476. Lunar Code	1 Jan 2021 22:45	0
This problem is very hard(easy),I cannot(can) solve it!	Accepted	1000. A+B Problem	1 Jan 2021 04:46	1
It is not possible to find solution using bruteforce for python.	master8282	1005. Stone Pile	1 Jan 2021 03:21	1
Hint	Mickkie	2132. Graph Decomposition. Version 2	30 Dec 2020 19:37	1
brute-force	lian lian	1535. The Hobbit or There and Back Again	29 Dec 2020 20:15	1
WA #5, HELP ME PLEASE! ! ! !	zhiganov_v	1351. Good Gnusmas – Dead Gnusmas	28 Dec 2020 22:49	0
Hint	OpenGL	1514. National Park	28 Dec 2020 19:50	1
what is the way to the solution?	TinyJanssen	1889. Airport Announcements	28 Dec 2020 16:44	2
Has anyone passed using only randomization without cheating ?	Manciu Ion	1394. Ships. Version 2	27 Dec 2020 23:43	4
Explanation of problem statement	SkidanovAlex	1740. Deer is Better!	27 Dec 2020 14:14	3
кривое условие [ Pages: 1, 2, 3 ]	Rybinsk SAAT (Nechaev, Kiselev, Mirzoyan)	1740. Deer is Better!	27 Dec 2020 14:04	49
why greedy is right?	Edric Mao	1108. Heritage	27 Dec 2020 11:43	4
WA 49 Hint	Dmitriy	1216. Two Pawns and One King	27 Dec 2020 00:49	0
For those who get WA 18	MyCatWantsToKill	1120. Sum of Sequential Numbers	26 Dec 2020 11:23	0
Is segment tree N*log(n) solution too slow or there is better implementation	Vitalii Arbuzov	1470. UFOs	24 Dec 2020 14:33	2
optimization	Grandmaster	1452. Pascal vs. C++	23 Dec 2020 04:00	1
1s are located at (i-th Tri-angular number + 1)th position	A. A. Noman Ansary	1209. 1, 10, 100, 1000...	23 Dec 2020 01:12	0
Задание с подвохом? (спойлер)	Desserg	1723. Sandro's Book	22 Dec 2020 22:55	2

Style: flat | tree | nested
Thread Order: bubble | fixed