@MartinBüttner about the 'how we can fit in' post, couldn't new/existing tags and a custom search query to only show/exclude the tag(s) work well in the meantime?
@ZachGates I'm using an online interpreter, so no files. And I want to input non-printable ASCII, so I need to use a string for stdin with the ability to call sys.stdin.read(1).
how do you clear a balancing group in regex? I thought (?<-a>(?=.))* should definitely work but it doesn't seem to (@MartinBüttner :)) (First I thought (?<-a>)* might be enough)
$ python
Python 2.7.6 (default, Jun 22 2015, 17:58:13)
[GCC 4.8.2] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> x = 10
>>> x/~x
-1
>>>
Read from standard input a positive integer k<9 and a sequence
of k distinct decimal digits.
If there are 2 equal elements in the sequence, exit with an
error.
Assuming there was no error, print the sum of all natural
numbers with given digits (without repetitions).
Eg. for k=2 and digits 1 and ...
I am not clear on how to frame my question. I am making the website for my college fest, and although I know HTML, CSS, I don't know anything of PHP. I just want to display my URLs like this:-
www.somesite.com/somepage (something like that)
instead of :-
www.somesite.com/somepage/index.html
H...
I cannot believe that summing challenge has been on the site for twenty minutes and got 4 downvotes but no one even bothered to add the fastest algorithm tag. Don't just downvote, fix.
asymptotic time complexity. (definition) Definition: The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation. See also asymptotic space complexity.