Nov. 23, 2017, 1:37 p.m. |
+ 1 |
for Comment
Miaou: If I may: def mp(t): could be replaced by '{:+.3g}'.format(t) which tells to format t with: * 'g' to...
|
Nov. 23, 2017, 1:37 p.m. |
+ 1 |
for Comment
bunnychai: Your result: ["7*x*x*x+21*x*x+123*x+558","2786*x+5022"] Right result: ["7*x*x*x+14*x*x+88*x+302","14...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Bilou06: 3 solutions to validate my guess : 1. add a timer or useless lines to slow down your program and get...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: Hello Bilou06! We actually have a few tasks in the works, but they do take some time to write and pr...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
bryukh: At the CheckiO we have many users, which are not so advanced as you. They are only begin to teach py...
|
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
Tiktin: unique_letters = {} You can replace line 4-7 with the following line: my_letters = set(list(''.join(...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
thugasin: Perfect solution, very clean and readable!
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
veky: This recursion is really misplaced here. Python is not particularly recursive language, depth is cut...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
kvas: So if I understand it correctly, you'd construct the expression from digits and symbols (+-/*) and t...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
bryukh: I am using PyCharm linter (in 2.7 it's full pep8) and SublimeLint in SublimeText2. But using whitesp...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
bryukh: It's really nice solution. It's short, it's readable, it's simple. Little PEP8 and docstring, and it...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
kvas: This looks right. Congratulations! If you want to speed it up, you could probably get rid of eval an...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
sethammons: assert checkio([[3, 3], [2, 7], [5, 9], [8, 7], [7, 3]]) == 26, "Pentagon" Your recursive solution i...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
cosmos: xc, yc = c your method is so cool!!
|
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
kvas: In principle this idea might work I think. If you reduce the number of 'symbols' to 5 ('', '+', '-',...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
kvas: Using integer division ("//") is not correct here. With integer division you may get something like ...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
kvas: Cool idea! However: 392039 -> ((3 + 9) * ((2 / (0 - 3)) + 9)) = 100 We probably need some more tests...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: Just a quick update. I have escalated this issue in our bug tracker. The developers are working on a...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: I like that idea. Maybe a star developer on CheckiO has a profile picture surrounded in gold or they...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: Perhaps we could reach out to other famous Python developers and have them be a part of the communit...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Vachenzo: Okay, I have talked with the developers and they are aware of the issue. I have created a new ticket...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
bryukh: I propose to set Guido's level at 99 :)
|
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
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: The idea is to discerne presence of special class member ( or classes in the future ), we need a sym...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
oduvan: I had a thought about it. I wanted to make separate timeline of famous users in CheckiO
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
oduvan: I think it is a good point. But Im not sure how status can help to show Guido to other 20 000 users.
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Bilou06: If brute force happens to be the fastest solution, it means that test cases are too short. It cannot...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Miaou: Hi, I totally agree that there are not enough votes for a real community-ranking system (expecially ...
|
Nov. 23, 2017, 1:36 p.m. |
+ 1 |
for Comment
Bilou06: I'd like to develop ranking criteria, because I am one of those who proposed that evolution. Based o...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
guido: I would have liked a docstring or comment here explaining what the inputs and outputs are and what t...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: Using time inside your function is not good practice if this is working code, because this can affec...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: Similar task was at Euler project, so you can to search solution for this task in Euler disscusions.
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: No :) Just type in google "Euler project" and you will get what i mean.
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: For your test in performance you can use python module timeit. It can be maked as decorator, also yo...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: The idea it self is good, because it prevents the need to regenerate the primes whenever you change ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
Tiktin: See what happens when you try checkio(-1). You are stuck in an endless loop. Also the values for che...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: Thanks. We reworked almost all tasks in the map and did for these tasks explanation tests (picture a...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: it's the same. python -c "from math import sqrt; print(sqrt(2)); print(2**0.5)" 1.41421356237 1.4142...
|
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
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
bryukh: If you don't need to restrict scope of functions, better at outside. Because it easy to read and reu...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: If you have little time, i recommend you read the book "The Art of Readable Code". It's contain many...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: Dont Repeat Yourself.
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: For interpretator is the same. But separate function, if you have two or more call, is more readable...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: python -m profile file.py it's tool for understanding what, how often and how long called in your pr...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: For list with primitive data types, you can use "[:]". "copy" and "deepcopy" are "swiss knife". Its ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
toufalk: cpt += (visible[i] == True) Yes you can. Or even return sum(visible) This will eliminate the counter...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
toufalk: cpt += (visible[i] == True) The count (lines 55-57) can be improved in a pythonic manner: cpt=sum(1 ...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: Agree with toufalk. Also for most of name conventions UPPERCASE using as constant, so "C" little con...
|
Nov. 23, 2017, 1:35 p.m. |
+ 1 |
for Comment
bryukh: Nice. Some remarks -- too long lines and we don't know French :)
|
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
bryukh: Sorry, i didn't want to offend you :) For reviews i use "Random review" feature -- in this mode i do...
|
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
bryukh: Hm, off the top of one's head, if before to return you need to process returning data or if you need...
|
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: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
bryukh: 2/21 = 0,095238095238... repeating part (095238)
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
bryukh: I don't understand about first definition of "prolonge". What for?
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
bryukh: http://www.python.org/dev/peps/pep-0008/ It is python style guide for code. You can use console chec...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
bryukh: http://www.checkio.org/profile/user/list/Avaris/ (not "vs" in top you can select "all") And then cli...
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
bryukh: Thank :) Look to Avaris user - he is awesome.
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
bryukh: Read pep8, please. If break lines and add whitespaces - it will be more readeable.
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
bryukh: Pretty oneliners :)
|
Nov. 23, 2017, 1:34 p.m. |
+ 1 |
for Comment
bryukh: doc={' ':0,'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10,'k':11,'l':12,'m':13,'n':14,...
|
Sept. 15, 2016, 12:42 p.m. |
+ 1 |
for Task
Multiplication Table
|
Sept. 15, 2016, 8:47 a.m. |
+ 1 |
for Task
Saw the Stick
|
Feb. 4, 2016, 8:52 a.m. |
+ 1 |
for Task
Codeship
|
Feb. 3, 2016, 4:37 p.m. |
+ 1 |
for Task
Mono Captcha
|
Feb. 2, 2016, 5:04 p.m. |
+ 1 |
for Task
Earth Distances
|
Jan. 31, 2016, 3:39 p.m. |
+ 5 |
for
4D-veky
|
Jan. 30, 2016, 2:41 p.m. |
+ 1 |
for Task
Haunted House
|
Jan. 30, 2016, 2:27 p.m. |
+ 5 |
for
Supercover line-DiZ
|
Jan. 29, 2016, 2:16 p.m. |
+ 1 |
for Task
Bats Bunker
|
Jan. 29, 2016, 2:15 p.m. |
+ 5 |
for
Ooooo-MagiMaster
|
Jan. 28, 2016, 6:14 p.m. |
+ 5 |
for
translate 2-Sim0000
|
Jan. 28, 2016, 7:15 a.m. |
+ 1 |
for Task
Express Delivery
|
Jan. 27, 2016, 5:39 p.m. |
+ 1 |
for Task
Pearls in the Box
|
Jan. 23, 2016, 3:40 p.m. |
+ 5 |
for
First-ciel
|
Jan. 21, 2016, 8:10 a.m. |
+ 1 |
for Task
Chicken Hunt
|
Jan. 21, 2016, 8:04 a.m. |
+ 1 |
for Task
Reverse Engineer
|
Jan. 21, 2016, 7:48 a.m. |
+ 5 |
for
Recursive two-tuple iterator-macfreek
|
Jan. 14, 2016, 4:47 p.m. |
+ 1 |
for Task
Magic Domino
|
Jan. 14, 2016, 3:51 p.m. |
+ 1 |
for Task
Cipher Crossword
|
Jan. 9, 2016, 6:11 p.m. |
+ 1 |
for Task
Supply Stations
|
Jan. 2, 2016, 12:59 p.m. |
+ 1 |
for Task
Forgetful Prisoner
|
Dec. 26, 2015, 2:45 p.m. |
+ 1 |
for Task
Expected Dice
|
Dec. 25, 2015, 2:58 p.m. |
+ 1 |
for Task
Fruit Snake
|
Dec. 23, 2015, 4:58 p.m. |
+ 1 |
for Task
Family Gifts
|
Dec. 21, 2015, 7:42 a.m. |
+ 1 |
for Task
The Lantern Festival
|
Dec. 17, 2015, 5:08 p.m. |
+ 1 |
for Task
Magic Square
|
Dec. 17, 2015, 4:20 p.m. |
+ 5 |
for
First-Sim0000
|
Dec. 16, 2015, 5:21 p.m. |
+ 5 |
for
Second-gyahun_dash
|
Dec. 15, 2015, 7:43 p.m. |
+ 1 |
for Task
Golden Pyramid
|
Dec. 15, 2015, 4:42 p.m. |
+ 1 |
for Task
Break Rings
|
Nov. 22, 2015, 1:08 a.m. |
+ 1 |
for Task
Water Jars
|