15
Last seen 2 years ago
Member for 10 years, 2 months, 20 days
Difficulty Normal
April 30, 2021, 4:17 a.m. | + 4 | for sets are great-Leonix |
April 28, 2021, 3:29 a.m. | + 4 | for eat_value(deque)-flpo |
April 19, 2021, 10:13 a.m. | + 4 | for First-Hashmore |
April 13, 2021, 1:26 p.m. | + 4 | for Artificial_0.3-Viktor_Ivanov |
April 11, 2021, 9:15 p.m. | + 4 | for short for long repeat-barrettpaulj |
Nov. 23, 2017, 1:44 p.m. | + 1 | for Comment Cjkjvfnby: Making own implementation for standard library functions is not clear. Using standard library functi... |
Nov. 23, 2017, 1:43 p.m. | + 1 | for Comment Sim0000: You can use int(x, k) to convert k-radix representation to integer. |
Nov. 23, 2017, 1:43 p.m. | + 1 | for Comment MatthiasWiesmann: Indeed, I did not know about bin, although you might want to do bin(n ^ m)[2:].count('1') to get rid... |
March 7, 2014, 9:51 a.m. | + 1 | for A bit too expensive, using sorted-MatthiasWiesmann |
March 7, 2014, 9:46 a.m. | + 1 | for First-MatthiasWiesmann |
March 5, 2014, 7:04 p.m. | + 3 | for First-ignalion |
March 3, 2014, 8:06 p.m. | + 1 | for First-MatthiasWiesmann |
March 3, 2014, 5:20 p.m. | + 2 | for First-MatthiasWiesmann |
March 2, 2014, 9:06 p.m. | + 2 | for First-MatthiasWiesmann |
March 2, 2014, 9:03 p.m. | + 2 | for Hinted-veky |
March 2, 2014, 9:02 p.m. | + 2 | for First-mkandacio |
March 2, 2014, 6:23 p.m. | + 1 | for Second-jcg |
March 2, 2014, 12:12 p.m. | + 1 | for With libs-MatthiasWiesmann |
March 1, 2014, 6:55 p.m. | + 2 | for First-MatthiasWiesmann |
March 1, 2014, 6:02 p.m. | + 2 | for First-lmp |
March 1, 2014, 6:02 p.m. | + 2 | for Second-XSlicer |
March 1, 2014, 6:02 p.m. | + 1 | for First-sodium |
March 1, 2014, 6 p.m. | + 2 | for Speedy-Cjkjvfnby |
March 1, 2014, 6 p.m. | + 2 | for First-htamas |
March 1, 2014, 5:49 p.m. | + 2 | for Yat another code-Ch0bits |
March 1, 2014, 11:45 a.m. | + 2 | for First-stalk13 |
Feb. 28, 2014, 6:05 p.m. | + 2 | for First-hiroyan |
Feb. 27, 2014, 8:50 p.m. | + 1 | for Comment veky: The most amazing thing is that someone dared to consider it _too long_. :-DD |
Feb. 27, 2014, 8:50 p.m. | + 1 | for Comment veky: If you look at the comments, you'll see it's still too slow for many people. Or it uses too much mem... |
Feb. 27, 2014, 8:36 p.m. | + 1 | for First-veil |
Feb. 27, 2014, 8:25 p.m. | + 1 | for Comment veky: Nice and clear. However, it's O(n) only if you assume that sets are O(1) to add. Generally, complexi... |
Feb. 27, 2014, 8:08 p.m. | + 1 | for Use built-ins-cort6284 |