Write a function matched(s) that takes as input a string s and checks if the brackets "(" and ")" in s are matched: that is, every "(" has a matching ")" after it and every ")" has a matching "(" before it. Your function should ignore all other symbols that appear in s. Your function should ret...
@Sherlock9 Let f denote a step forward, b a step backward in the collatz sequence. The pattern b->f cannot be in a shortest path, as it is the identity (f is undoing b in any case.) So the shortest path can only consist of patterns f->f, f->b and b->b. That means again that the shortest path is always of the form f->f->...->f or b->b->...->b or f->...->f->b->...->b
I wanna be the very best...
Wow, there's so many Pokemon in my Pokedex! Well, there seems too many... I wish there was some good way of sorting all of them!
Can you help?
Given a list of Pokemon with their stats - level and HP - and a sorting criterion, output the sorted list.
An example inpu...
@Zgarb how does _ work? I tried p\3i on input [1 2 3 4 5] to get all substrings of length 3 but it doesn't work, so I assume I need a _ somewhere in there?
@RohanJhunjhunwala I am as well. People seemed to really like it in the Sandbox (four or five upvotes in the span of 24 hours, and a few clarification comments), but then only two Python answers until your Java answer. /shrug
@Winny You should get GreaseMonkey and click here for the /me command (and a lot more commands that you probably won't use, I use it and it's very nice)
@NathanMerrill well she's aware of it and the fact that I'm a mod (and that I spend a lot of time on it). :P ... I also occasionally show her some challenges when there's some cool graphical output or something.
Lol. I Googled "8th circle of hell programming language" (without quotes)
Basically all Malbolge results
Hang on a second... I get the same results for "6th circle of hell programming language" and "7th circle of hell programming language". I call foul play.
Brainfuck, 47 bytes
++++++++++[->++++>+>+<<<]>++>[-<..........>>.<]
Try it online!
++++++++++[->++++>+>+<<<] set the tape to 40 10 10
>++> set the tape to 42 10 10
[-<..........>>.<] come on
Despite having What qualifies as malicious code?, the consensus seems really unclear on that point, because this question seems to be valid, and that one isn’t.
In the current case, please note the parsers of such programs tend to be designed to be insecure, so it’s easy to google for examples...
Sclipting
Jannis Harder
Geom++
Qwertycode
Esoteric Topics in Computer Programming
GridScript
Alisj
Brainbrain
Hello, world!
0x29C
Gott
There Once was a Fish Named Fred
Arbitrary effect at an arbitrary point
Smartboxes
Traceback (most recent call last):
File "esosearch.py", line 13, in <module>
print(getlang())
File "C:\Users\Elie\AppData\Local\Programs\Python\Python35-32\lib\encodings\cp850.py", line 19, in encode
return codecs.charmap_encode(input,self.errors,encoding_map)[0]
UnicodeEncodeError: 'charmap' codec can't encode character '\u2666' in position 0: character maps to <u…
It should:
Encrypt
Decrypt
Encrypt in another way every time you start it (So it should generate
a new encryption pattern).
It should support the characters 33-127 and 160-255 (http://www.ascii.cl/htmlcodes.htm)
I did this in 3,621 bytes while not trying to keep it small. Good Luck!
A positive integer k is a Loeschian number if
k can be expressed as i^2 + j^2 + i*j for i, j integers (^ represents power).
For example, the first positive Loeschian numbers are: 1 (i=1, j=0); 3 (i=j=1); 4 (i=2, j=0); 7 (i=2, j=1); 9 (i=-3, j=3); ... Note that i, j for a given k are not uniq...
Most of the programming I do everyday is C++. I don't care anymore what programmer prefers what indention or formatting. Before each commit, every source file is processed by clang-format with a company-wide rule. So everyone can use whatever they like and the codebase is consistent.
Challenge idea: calculate the number of classes of primitive positive definite binary quadratic forms of discriminant D = -4n; or equivalently the class number of the quadratic order of discriminant D = -4n.
Write a function matched(s) that takes as input a string s and checks if the brackets "(" and ")" in s are matched: that is, every "(" has a matching ")" after it and every ")" has a matching "(" before it. Your function should ignore all other symbols that appear in s. Your function should ret...
I wanna be the very best...
Wow, there's so many Pokemon in my Pokedex! Well, there seems too many... I wish there was some good way of sorting all of them!
Can you help?
Given a list of Pokemon with their stats - level and HP - and a sorting criterion, output the sorted list.
An example inpu...
Vim, 13 8 bytes
Saved 5 bytes thanks to @Lynn
qqi*♥9.o♥q9@q
10i*♥Y9p
Replace ♥ by <ESC>
C (gcc), 41 39 bytes
main(i){for(;++i<puts("**********"););}
Despite having What qualifies as malicious code?, the consensus seems really unclear on that point, because this question seems to be valid, and that one isn’t.
In the current case, please note the parsers of such programs tend to be designed to be insecure, so it’s easy to google for examples...
It should:
Encrypt
Decrypt
Encrypt in another way every time you start it (So it should generate
a new encryption pattern).
It should support the characters 33-127 and 160-255 (http://www.ascii.cl/htmlcodes.htm)
I did this in 3,621 bytes while not trying to keep it small. Good Luck!
A positive integer k is a Loeschian number if
k can be expressed as i^2 + j^2 + i*j for i, j integers (^ represents power).
For example, the first positive Loeschian numbers are: 1 (i=1, j=0); 3 (i=j=1); 4 (i=2, j=0); 7 (i=2, j=1); 9 (i=-3, j=3); ... Note that i, j for a given k are not uniq...
