### yermak0v's blog

By yermak0v, 8 years ago,

Hello everyone!

Today begins Code War 2013

Rules for contest:

1. Contest problems will become visible on Friday, 27 September 2013 at 15:00 hours IST and contest will end at 29th September 15:00 IST.. Check your time zone here.

2. This is a not a Team Contest. It’s an Individual contest.

3. This competition will be open globally. Anybody can participate and win prizes. But to claim the prizes, one should register here. (There will be one on campus (NIT Durgapur) and one off campus winner.

4. Almost all languages supported on CodeChef are allowed.

5. Each program will be tested based on our critical test data. However output and input should be exactly as specified in the samples provided. All white space characters in the output will be ignored.

6. Please contact debanjanochanda@gmail.com for any queries during the contest.

7. All participants are expected to abide by the CodeChef Code Of Conduct.

Good luck and have fun to all!

Read more »

• +19

By yermak0v, 8 years ago, translation,

Hi all.
Once upon a time I'm wrote about trie and profit and how useful it can be if use it for other purposes. link
In a word, if write a counting sorting, and use trie as associative array instead of the usual array, then can be achived O(n) complexity with not big constant. That is just add all numbers to trie and after it view all states with dfs (by that review all states in lexicographical order).
But would have to sacriface memory, because anyone vertices contains links to next stats.
P.S. To work correctly, all numbers must be completing with leading zeros.
UPD. code
I wonder will it be profitable to use this sorting instead of quick sort or another sort with O(n * log(n)) complexity.
P.P.S. Sorry my poor English.

Read more »

• +4

By yermak0v, 8 years ago, translation,

Just now ends Procon 2013 on Codechef http://www.codechef.com/PRCN2013/
I propose to discuss here problem solving. How solve 1-st?

Read more »

• +13

By yermak0v, 8 years ago,

Hi all.
I want to learn the divide and conquer technique. I'm read about it on wikipedia and other not well-known sites and understood this technique, but now i want to practice it.
Anyone know where i can solve problems on this techinque?

Read more »

• +9

By yermak0v, 8 years ago,

Hi all.
Today at 16:00 UTC will starts June Cook-Off 2013 on Codechef.
GL & HF to all!

Read more »

• +19

By yermak0v, 9 years ago, translation,

When I try to practice any contest I gives an error 405:

What is a bug?
P.S. Bug only in practice on contests.

Read more »

• +19

By yermak0v, 9 years ago, translation,

Hi all!
Who could tell me about Polygon? Please explain:
1) How I can add big test cases to problems in Polygon, or how I can write a script to their generetion?
2) What is a Package? And how to use them?
3) Can I add checker in some way?
4) What is validator? everything is clear sorry not clear.
5) What is Well-formed tests?
6) What I can do in the tabs Stresses and Issues?
7) Does it make sense to write tutorial to problem in General info/Problem tutorial?
8) How to add user to the author of problem? When you add another user to every problem — she is empty. What to do?
UPD 9) How to write with new line?
Sorry my poor english.

Read more »

• +4

By yermak0v, 9 years ago, translation,

How to add userscript in Chrome? In Firefox with Greasemonkey is simple, but in Chrome I can not find how. Tell me, please. Don't offer: search the google etc. All I found garbage, and not working.

Read more »

• +9

By yermak0v, 9 years ago, translation,

If on trie change bool field "leaf" to field of anyone type, then it be possible to use it as associative array. For it just translate key type to string, and feild value write to leaf of the relevant field. Maybe it will be associative array? If this is true then it can be a new data structure.
P.S. Sorry my poor English.

Read more »

• +11