April 17, 2013, 9:02 a.m. |
+ 1 |
for Comment
idkfa32: o.k. maybe some problem with web-page and my default web browser (dwb) ... next time i use firefox s...
|
April 10, 2013, 2:20 p.m. |
+ 1 |
for Comment
suwanditan: Yep, it does not scale nicely :) However, the idea is predefined definition and speed. To scale nice...
|
April 9, 2013, 3:26 a.m. |
+ 1 |
for Comment
Tiktin: Thanks bryukh. Here's my code: _________________________________ class checkio: def __init__(self, a...
|
April 7, 2013, 11:17 a.m. |
+ 1 |
for Comment
Rachid2306: re.sub(r'(!^(ht))(\d{3})(?=\d)', r'\1.', str(txt)[::-1])[::-1] This what I am trying to return (usin...
|
April 2, 2013, 3:49 p.m. |
+ 1 |
for Comment
profuel_39643665ff7744e3bff926: From task: "In addition to that, the fee for each withdrawal is $0.5 + 1% of the amount of cash with...
|
March 28, 2013, 3:56 p.m. |
+ 1 |
for Comment
profuel_39643665ff7744e3bff926: I guess you removed several 'imports' from your code. Please provide full source.
|
March 16, 2013, 5 p.m. |
+ 1 |
for Comment
Bibiche: The 'X' are replaced by '' ; so less memory used I suppose. You can suppress "First" of course, beca...
|
March 16, 2013, 4:59 p.m. |
+ 1 |
for Comment
Bibiche: Thank you; I will try to, next time.
|
March 12, 2013, 6:48 p.m. |
+ 1 |
for Comment
adrin: why O(n) instead of O(1)?
|
March 12, 2013, 6:41 p.m. |
+ 1 |
for Comment
adrin: I agree, brute force is not the best solution.
|
Feb. 28, 2013, 3:18 p.m. |
+ 1 |
for Comment
Flid: Brute forcing is a horrible thing, really. Dynamic programming for 0-1 knapsack gives you a fast and...
|
Feb. 27, 2013, 5:16 a.m. |
+ 1 |
for Comment
username724: result = 'zero,one,two,three,four,five,six,seven,eight,nine,ten,eleven,twelve,thirteen,fourteen,fift...
|
Feb. 27, 2013, 5 a.m. |
+ 1 |
for Comment
username724: def checkio(i): Definitely better than mine.
|
Feb. 26, 2013, 7:42 p.m. |
+ 1 |
for Comment
ichaleynbin: I concur with parmando. While it's a very concise method, it is also pretty much unreadable. Yes, py...
|
Feb. 3, 2013, 3:57 a.m. |
+ 1 |
for Comment
funningboy: return re.sub(r'(?<=\d)(?=(\d\d\d)+\b)', '.', str(txt)) Awesome!
|
Jan. 24, 2013, 4:32 p.m. |
+ 1 |
for Comment
zeller: seems to run in exptime...
|
Jan. 21, 2013, 1:52 p.m. |
+ 1 |
for Comment
Miaou: Thanks. I used to program nicely, but I didn't catch that much attention. I remarked something : the...
|
Jan. 3, 2013, 3:06 a.m. |
+ 1 |
for Comment
salamanderrake: Thank you. forgot about the fees.
|
Dec. 20, 2012, 8:52 a.m. |
+ 1 |
for Comment
parmando: hum you mean removing the recurtion completly or simply a double for loop for launching the recurtio...
|
Dec. 12, 2012, 12:25 p.m. |
+ 1 |
for Comment
macfreek: For the record, I do not suggest to actually rewrite the problem statement like this -- that is prob...
|
Dec. 12, 2012, 12:15 p.m. |
+ 1 |
for Comment
macfreek: That condition is clear. What is, from a formal mathematical standpoint, not clear is what defines a...
|
Dec. 9, 2012, 11:06 a.m. |
+ 1 |
for Comment
ezimir: I think I get it now. Depending on who's turn it is to raise, they'll first check if their next offe...
|
Dec. 9, 2012, 1:50 a.m. |
+ 1 |
for Comment
mattbasta: This problem can only be solved with brute force. Every other solution is flawed. This problem is a ...
|
Dec. 7, 2012, 10:16 p.m. |
+ 1 |
for Comment
SpiderX: I disagree with your statement that 'one return at the end is better than two' - return as soon as p...
|
Nov. 22, 2012, 1:52 a.m. |
+ 1 |
for Comment
while0pass: Your solution can be slightly improved with len(stones) // 2 + 2 changed to len(stones) // 2 + 1
|
Nov. 12, 2012, 11:38 p.m. |
+ 1 |
for Comment
bsoist: Nice solution. Mine is faster on the special cases, so I did some comparison to sort out the best wa...
|
Nov. 12, 2012, 11:53 a.m. |
+ 1 |
for Comment
DanielGaray: for var in combinations(stones, i): don't worry, in spanish is I didn't know the "combinations()" ut...
|
Nov. 9, 2012, 10:40 p.m. |
+ 1 |
for Comment
Barti: Ok I'll try that thanks ! As it was working with just a round at the end I thought it was the right ...
|
Nov. 9, 2012, 4:06 p.m. |
+ 1 |
for Comment
Tyber: Well it's just detail, but it misslead me. But with your help, now my code is correct and i pass the...
|
Nov. 8, 2012, 10:39 p.m. |
+ 1 |
for Comment
Pilou: Cheat !
|
Nov. 8, 2012, 10:35 p.m. |
+ 1 |
for Comment
Pilou: Brute force. For scoring it's be good to add a number of total instruction counter !
|
Nov. 7, 2012, 8:28 a.m. |
+ 1 |
for Comment
Rizach: Ah, that makes a huge difference, here I was caluclating on a hexadecimal base :p
|
Nov. 7, 2012, 5:13 a.m. |
+ 1 |
for Comment
Noriak: Another way of rotation: zip(*cipher_map[::-1])
|
Nov. 6, 2012, 11:31 p.m. |
+ 1 |
for Comment
jlund3: "In the beginning you should propose him just a little bit of money for the ship and he, in his turn...
|
Nov. 5, 2012, 6:06 p.m. |
+ 1 |
for Comment
Project_Guerilla: I just searched StackOverflow :-)
|
Nov. 3, 2012, 6:40 p.m. |
+ 1 |
for Comment
Project_Guerilla: really interesting matrix rotation... I would not have figured that out with indecies cipher_map = [...
|
Nov. 3, 2012, 3:26 a.m. |
+ 1 |
for Comment
Project_Guerilla: Wow - this is not readable at all. Even if it does the job and performs well I'd hate to have to deb...
|
Nov. 1, 2012, 5:29 a.m. |
+ 1 |
for Comment
sleepyone: Bellman-Ford is a bit overkill -- you can use a simple dynamic programming approach :)
|
Oct. 30, 2012, 9:59 p.m. |
+ 1 |
for Comment
pjwerneck: This kind of challenge is very interesting, it sets checkio apart from other similar services. I'd l...
|
Oct. 27, 2012, 4:18 a.m. |
+ 1 |
for Comment
kernc: not if you `round` it to five decimal places. In EU with Euro, prices are legally rounded to two dec...
|
Oct. 26, 2012, 4:17 p.m. |
+ 1 |
for Comment
oduvan: btw. Here in CheckIO we have a posibility to report about a wrong publication or solution right on t...
|
Oct. 26, 2012, 4:06 a.m. |
+ 1 |
for Comment
jfw: decimal is part of the stdlib, so that's not an issue. Floats should never be used to store monetary...
|