Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
yttamer: Actually it is a good idea but it may kill the original solutions. Because when we add tips to quest...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
zookatron: Hey, thanks for the review! :) Basically, after solving the problem I realized my solution is the sa...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
veky: Well, the only thing I can think of that made you say that is function u (for update). I admit that....
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Bibiche: If you solve the tasks that fast and nice, it's surely because you are highly high level. So : you a...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: Your English is very good and so is your code! Keep up the awesome work! -an English speaking Americ...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
profuel_39643665ff7744e3bff926: you could make one big if/elif for all 100 numbers. But main idea is to shorten this if/elif for gen...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Bibiche: Hi ! I'm French too, and just like you, I wrote all my solutions in French. I thought none would rea...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
nickie: My solution is based on [Church numerals](http://en.wikipedia.org/wiki/Church_encoding). Functions c...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: Followup question for you: Which operating system and web browser are you using? Does this problem h...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
VassiliyTaranov: def bfs(map, x, y, stack): it's dfs. not bfs
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: I'll make a note for the next staff conference!
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
veky: Bilou06 is right. (small) integers and half-integers are always represented exactly in floats. The p...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
fcborel: Hello I see 2 good ideas in your solution : - the methode using det for the area's calculus for a tr...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
nickie: This is a fixed version of my [first solution](http://www.checkio.org/mission/colder-warmer/publicat...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
nickie: What you have here is an awesome solution; well done! I believe that you need 9 steps (also counting...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
kvas: I think it would be quite useful to be able to solve the same tasks in different languages. This wou...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: You'll need to return if the password matches the specific the length of the password and make sure ...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
profuel_39643665ff7744e3bff926: - you could learn and use "re" module, to work with regular expressions - you could create several s...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: We could also make it so all his actions show up in the global timeline. These actions could be colo...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
suwanditan: I propose group with range of level associate with it, eg: 99 for "the Patriarch", "the Architech", ...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
suwanditan: I like the idea 99th level. it is so game-ish :)
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Bibiche: I'm not sure either ! The question is still to solve : how to make each of his precious comments a r...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
oduvan: Yup :) Russian + French! Other countries will get here soon :)
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Bilou06: We will end up with a French section...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Miaou: Hi, I'm Pierre-Antoine, from France. I'm a PhD student. I've been using Python for 3 or 4 years now,...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
JeromeJ: return (lambda r: r if r else 'zero')(' '.join(filter(lambda p: p, [(spe.get(d.get(2)), 'hundred'*bo...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
kvas: It exploded into a thousand pieces :) More or less like this: When I started working with it there w...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
nickie: I second the suggestion to support other languages. My team at NTUA have already contacted CheckIO a...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
profuel_39643665ff7744e3bff926: even in task demo, it's stated that 131 is correct answer here.
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: in decrypt(data, cipher) What made you break the long line this way? It would look much better like ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: Some notes on the problem first: The problem doesn't require much algorithmic thinking; it just requ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
DiZ: Here you must distinguish two types of assignment: - Multiple assignment: a, b = 0, 1 - Multiple-tar...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
chip: It was my first attempt, and I have just sent my solution as a comment :-)
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: I've forgotten to treat obvious case: line 10, missing: if len(simple)%2 != 0: return False
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: I had thought about Sieve of Eratosthenes, but the difficulty here is that we have no majoration of ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
macobo: Abusing eval. Very cool (but potentially hazardous if users can give the input)! :) I think you coul...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
czert: that while loop in coor() could get really expensive...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: I like the explanations too. It's very important for the first time we try Checkio! I will probably ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
toufalk: Wow !! What a magical regexpr !! But my solution is better for 3 reasons: 1) the regpexr brute force...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: Hi ! You make me read my "old" codes... and, just like Bryukh's, my eyes are damaged by my illisible...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
fcborel: Hello Bibiche. As you, I forget how to find the index of a letter in a string (for instance give the...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
parmando: nice as always
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
suwanditan: Ah, I see what you mean. Is that faster, as generator, than passing my primes?
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
suwanditan: I'll refactor it, then :) Thanks ya
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
nicuveo: Thanks! Submitted at last. :)
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
suwanditan: The idea is from Wolfram: Decimal Expansion, which is there is predefined prime denominator that rep...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: for k in range(2,int(math.sqrt(n))+1): You are importing the entire math module just for using the s...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: Your code doesn't deal correctly with integers smaller than 2. For example the following cases shoul...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: def est_palindrome(a): This function as a lot of overhead: transforming int=>str=>list and using dee...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: if number == 1 or number == 2: This is incorrect. 1 is NOT a prime number. See the following for det...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: By the way this author also as a couple of other free books in the area of complexity and statistics...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: For beginners I would recommend reading "Think Python - How to Think Like a Computer Scientist" by A...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: Thanks ! -I think I should so create a function Thanks() ! -
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
fcborel: I will try l1 = l2[:]. Thanks
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
htamas: > Any ints? Both [...] will pass the grader? The grader accepts anything (that is formally correct) ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
DoctorProk: Thanks, I will have to look up dynamic programming. But that narrows the field of possible solutions...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
toufalk: "C" is not a good variable name for a very simple reason: a reader do not knows what is "C" for and ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: Hi! You did absolutely not offend me!!! I agree 100% with your comments on this solution! And I real...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
fcborel: Thank's "Bibiche" for your insightful comments... I'll change my bad habits with the name of variabl...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: I know these habits well because they were mine a few days ago. I risk heart attack each time I read...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
fcborel: Thank you for the warning in the use of this variable....
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
DoctorProk: Thanks again, I solved it. But my solution still does it by brute force. I was looking into your dyn...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: As you go down through the levels of a triangle, the number of items is increased by at least one (i...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
mattbasta: A quick browse through the list of solutions shows that the top solutions are all exhaustive. If you...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
fcborel: Thank's for your comment 2) I agree with the test with boolean 3) About the probleme with "reverse":...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: Hello ! I like your solution. Let me propose some ideas : see attached file. 1) I return a result as...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bibiche: I like your solution. Some ideas : 1) What about "return False" lines 11 - 15 - 18 - 25 and "return ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: best = math.floor(total / 2) You can use // again here. You can then remove "import math" from your ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: ''' It's pretty random that you're using ''' for the docstring here and """ elsewhere. I recommend u...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
lmp: Thanks ! Old print syntax in python3.3 was fixed yesterday, and apparently "Fail:base" is due to an ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: The print statement that I see in the python 3.3 version is: "print('NO WAY :(')" which is valid syn...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Bilou06: Hi, Open the solution, press 'Solve', your code was saved. 'Run and Check' and you can publish Bilou...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: 'Return True if password strong and False if not' Most programming style guides use "triple double" ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: This is a perfectly acceptable solution for passwords, which are typically not very long. I am going...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: if __name__ == '__main__': It's hardly necessary to add the 'First' or 'Second' messages to the asse...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
PositronicLlama: return 1 << (len(stones) - 1) Thanks for all the code review feedback! I appreciate the time you put...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: In line 7, you're creating a list and then sort it just to get the maximum item. Why not just use ma...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: return 1 << (len(stones) - 1) This is probably better written as 2 ** (len(stones) - 1), so the read...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: y_size = math.floor(total / 2) + 1 Again, I think you can use // and avoid using the math module:
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
ParadisiacMercy: BTW, I'm not actually a developer in my company. This is more like a hobby than a job for me. I foun...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
ParadisiacMercy: Well, it's my company's way of it since we have other programmers work on other languages. ;-P
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Avaris: You're right about 'sequences shorter than 4' but creating sequences only with length 4 would compli...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
rmidyanyy: Nice solution. I really like the way diagonal sequences are generated. Just two suggestions: 1. Use ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: val2numeral = [[1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'],...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
MasterSergius: My solution bases on this trick - http://stackoverflow.com/questions/5084801/distance-between-tiles-...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
skeet70: Thanks! That's pretty much what I was going for. Could've done a one-liner of some sort I'm sure, bu...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
wolfnether: because 42 is the asnwer of everything
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
archeg: I know that now. As the language I mostly working with is C# and Java, I just forgot about that. My ...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
Spoygg: Thanks, a bit confusing language though :) (at least for me)
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
JamLizzy101: Don't worry is now figured out. Realised there were 3 spaces as well as 2...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
PositronicLlama: Using decimal is very straightforward, but it doesn't support long repetition lengths. As an example...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
rmidyanyy: Recursion is a nice approach for such tasks. But I'd pay more attention to readibility if I were you...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
rmidyanyy: Yeap, it looks like it is :) But I was just solving task, not thinking about specific algorithm.... ...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
Bibiche: Sorry ! I try to think in English, but some words stayed in french despite my trying. I hope to be a...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
Bibiche: It is some try I have forgotten. Sorry ! How can I remove it without saving another version ? Thank ...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
username724: Thanks. This shows just how bad my bruteforce fail solution is. Oh well, back to the drawing board.
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
oduvan: http://docs.python.org/release/2.3.5/whatsnew/section-bool.html this is from an older version of pyt...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
oduvan: Sorry, where did you get info about unique symbols?
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
Tiktin: Instead of using: return abs(reduce(lambda x,y:x+y,l+[0])-reduce(lambda x,y:x+y,r+[0])) you could of...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
oduvan: Thanks for you feedback! Yes, definitely! We have plans to make it more friendly for mobile. Our tea...
|