Talk:UVa 517

From Algorithmist
Revision as of 20:43, 25 August 2009 by Larry (talk | contribs) (→‎Tricky cases)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Tricky cases[edit]

Are there any tricky cases? I've been working on this problem for days, it doesn't seem difficult, but I'm always getting WA. I've left a message here too: http://acm.uva.es/board/viewtopic.php?f=6&t=27206 but that forum looks dead. Any help would be appreciated, thanks! Giuseppe 15:03, 22 August 2009 (UTC)

My solution has been accepted. The tricky input was s=0 Giuseppe 20:04, 25 August 2009 (UTC)
Congrats! I was going to try to help, but then I realized I didn't solve this one yet.. =) Larry 20:43, 25 August 2009 (UTC)

Category[edit]

I have no clue what to categorize this as... Strings, number theory? --Rrenaud 15:53, 28 May 2005 (EDT)

Ya, I think I would like to only categorize the theories/algorithms, rather than trivial data structures, but ya..Larry 18:06, 28 May 2005 (EDT)