anup.kalbalia's blog

Invitation to the March 2012 Cook-off on CodeChef
By anup.kalbalia, 12 years ago, In English

CodeChef invites you to participate in the March 2012 CookOff.

Time: 2130 hrs 18th March 2012 to 0000 hrs, 19th March 2012 (Indian Standard Time — +5:30 GMT) — Check your timezone.
Details: COOK20
Registration: Just need to have a CodeChef user id to participate. New users please register here
Problem Setter: Hiroto Sekido (LayCurse)
Problem Tester: Rajiv Kumar Aggarwal

It promises to deliver on an interesting set of algorithmic problems with something for all.
The contest is open for all and those, who are interested, are requested to have a CodeChef userid, in order to participate.

  • Vote: I like it
  • +29
  • Vote: I do not like it

Comments Comments (11)
| Write comment?
»
12 years ago, # |
  Vote: I like it +4 Vote: I do not like it

It was my first Cook-off. I like the problems. But I was very slow with first 3 and I was out of time just before I was able to solve the forth one.

→ Reply
»
12 years ago, # |
← Rev. 2   Vote: I like it +21 Vote: I do not like it

What computers do you use for testing the solutions?

My solution for problem Ciel Numbers I runs locally in 0.150 seconds, but I got TLE on the server.

Is there any way to run solution on the server, to learn, how much time does it work?

→ Reply
  • »
    »
    12 years ago, # ^ |
      Vote: I like it +20 Vote: I do not like it

    Нияз, там иногда решение которые работают 0,1 локально в 3 сек не влазят.

    → Reply
    • »
      »
      »
      12 years ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      That's not good.

      What should I do to be confident that my solution runs in time?

      → Reply
      • »
        »
        »
        »
        12 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Sometimes I rewrite my solution on another language(today my solution(on fpc) got TL, but it got AC on gpc).

        → Reply
  • »
    »
    12 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    I remember that Gerald mentioned that his netbook is faster then testing machine.

    → Reply
  • »
    »
    12 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Floyd's algorithms gets TLE with TL=1s and V=500.

    → Reply
»
12 years ago, # |
  Vote: I like it +1 Vote: I do not like it

it's very unconvinient to search the problems in "practice". Could you make a opportunity to classify the problems by the contests where their were in?

→ Reply