| ENG RUS | Timus Online Judge |
Discussion of Problem 1999. The secret moduleYury_Semenov Smallest possible automaton // Problem 1999. The secret module 14 Feb 2024 16:19 My solution produces an automaton with 2n^2 + n states, but what is the smallest possible size? Is it still ~n^2? Edited by author 14.02.2024 16:19 Shen Yang Yes Accepted 0.078s [9] // Problem 1999. The secret module 8 Nov 2017 18:50 worked at least two months.... Shen Yang Re: Yes Accepted 0.078s [8] // Problem 1999. The secret module 8 Nov 2017 18:50 I think it is a hard problem,harder than some rating>1e4 problems... Mahilewets Nikita Re: Yes Accepted 0.078s [5] // Problem 1999. The secret module 8 Nov 2017 21:17 How did you get the skill to solve such a hard problems? I know generic patterns to effective skill training Interested in particular case Edited by author 08.11.2017 21:17 Shen Yang Re: Yes Accepted 0.078s [4] // Problem 1999. The secret module 9 Nov 2017 04:56 Just stop solving easy problems,and trying harder one.. I start solving hard problems since year 2010 practicing at http://poj.org solving AC<100 problems and at year 2013 I start solving topcoder Div I 1000pts.. later I found codeforces and start solve fewest AC problems.. There are also some Chinese oj hardest problems is very hard such like http://www.lydsy.com/JudgeOnline/ http://uoj.ac/ Mahilewets Nikita Re: Yes Accepted 0.078s // Problem 1999. The secret module 9 Nov 2017 22:34 Yeah, solving hard is very helpful, I felt it At some point I noticed that I am just not able to solve some harder problem Because it takes very much time to solve So even if trying whole day then cannot solve Maybe whole week is enough But very rarely have an opportunity to solve a problem the whole week Typical have only three hours per day But it's at cost of sacrificing important things So I feel like I cannot improve further Mahilewets Nikita Re: Yes Accepted 0.078s [1] // Problem 1999. The secret module 9 Nov 2017 22:34 Yeah, solving hard is very helpful, I felt it At some point I noticed that I am just not able to solve some harder problem Because it takes very much time to solve So even if trying whole day then cannot solve Maybe whole week is enough But very rarely have an opportunity to solve a problem the whole week Typical have only three hours per day But it's at cost of sacrificing important things So I feel like I cannot improve further Shen Yang Re: Yes Accepted 0.078s // Problem 1999. The secret module 10 Nov 2017 12:10 you can choose some easier than hardest problems but harder than medium problems if you don't have enough time to practice Mahilewets Nikita Re: Yes Accepted 0.078s // Problem 1999. The secret module 10 Nov 2017 00:16 On spoj.com I have lot of tasks in my TODO list... winger Re: Yes Accepted 0.078s [1] // Problem 1999. The secret module 13 Jan 2024 08:00 Why do you consider it a hard problem? It felt quite straightforward to me Yury_Semenov Re: Yes Accepted 0.078s // Problem 1999. The secret module 14 Feb 2024 16:16 Timus has very few constructive problems (at least with difficulty >= 2000), so this problem may seem hard compared to others if constructive problems are not your strong point Yury_Semenov How to test // Problem 1999. The secret module 14 Feb 2024 16:13 Bruteforce all short numbers (i. e. length <= 3) and feed them to both input and output automata, then compare. Here are some useful tests: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 0 1 0 1 3 3 3 3 3 3 3 3 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 8 3 0 1 0 1 3 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
|