amshz's blog

By amshz, history, 3 months ago, In English,

What's your favorite problem or contest?

Please Comment it ;)

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

»
3 months ago, # |
  Vote: I like it +30 Vote: I do not like it

Water Melon

»
3 months ago, # |
  Vote: I like it +13 Vote: I do not like it

CF1137C Museums Tour

»
3 months ago, # |
  Vote: I like it +19 Vote: I do not like it

sum of two numbers.

»
3 months ago, # |
  Vote: I like it +49 Vote: I do not like it

Serge and Dining Room

»
3 months ago, # |
  Vote: I like it +11 Vote: I do not like it

Codeforces Round #260 (Div.1)

»
3 months ago, # |
  Vote: I like it +6 Vote: I do not like it

IOI13 artclass

»
3 months ago, # |
  Vote: I like it +8 Vote: I do not like it

717I — Cowboy Beblop at his computer

»
3 months ago, # |
  Vote: I like it +11 Vote: I do not like it

158B — Taxi

»
3 months ago, # |
  Vote: I like it +16 Vote: I do not like it

I can't recall actually what is the most beautiful problem I've solved. Cause whatever problem I solve, no matter how good it was, I used to forget about the problem after few days. Recently I solved All Possible Increasing Subsequences from lightoj. I had to try continuously 5 days in a row to solve it. When I found out the solution & got Accepted sign, the feelings was awesome. There is another problem. Though I didn't solved this by myself. Problem — Kquery — Spoj I read the tutorial from DarthKnight's blog post . That's not the problem that amused me, it was the idea how to solve this. that was one of the most beautiful idea I've ever seen.

  • »
    »
    3 months ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    Yeah. When you solve a problem after much time thinking on it and many unsuccessful submissions, you feel great! I'll never forget such problems.

    • »
      »
      »
      3 months ago, # ^ |
        Vote: I like it +10 Vote: I do not like it

      I've some problems with my mind. Even if I stop practicing an algorithm in what I'm good at, I almost completely forget this algorithm. I just remember the very basic concept. Next time I try to solve with this, I've to read/learn it from very basic.

»
3 months ago, # |
  Vote: I like it +5 Vote: I do not like it

409F 000001

»
4 weeks ago, # |
  Vote: I like it +21 Vote: I do not like it

D. Mike and Feet

»
4 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

B. Uniqueness

»
4 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

cf1110H. Modest Substrings

I think the idea of this problem is very good.