If we reverse S, zip that with s2, and then reverse it again, we can enumerate over it to get the second half (this psuedocode is in the style of python)
But this is only if the algorithm analysis for regular Karatsuba uses O(n) for splitting the digits into two. If every operation it was composed of was O(1), then I just made a O(n * n^1.585) algorithm, which is really slow.
But if you, say, allowed the numbers 0 through 9, it becomes much easier (a good thing). If you allow 0 and 1, it works.
It breaks the no-numbers rule
def first_half(s):
flag = True
half_of_length = ""
for char in s:
if flag:
half_of_length += "x" # Assumes this is constant
flag = not flag
result = ""
for pair in zip(s, half_of_length):
result += pair[not True]
return result
The pair[not True] was trying to get around indexing with 0. Which only works since python's bools are integers...
> If you can come up with a program that doesn't use any of the digits 0 through 9, not including within string literals, you can take take a bonus of -5%.
I really should get to implementing the lexer for my CS class... rather than trying to just learn Boost's MSM library, I should probably start using it
My CS classes here have been boring so far. They didn't teach my anything new. The one this semester doesn't teach me anything new, but it gets me to implement new things (I've never actually implemented a lexer, parser, interpreter before)
@Calvin'sHobbies So I opened my first box of Froot Loops in ages today... and it turns out that there are only three different colours in German Froot Loops :(
Six people have gold answers for Tweetable Mathematical Art, and I feel mine is one of the least deserved, so this new gold badge for my first ever answer means much more to me.
@trichoplax It's how I felt after getting gold for Retina or Trash (a plain code golf challenge), after my first golds were for Vigil, Showcase and two Tweetable Maths answers.
What I'd meant was that having no accepted answer would allow other answers more visibility, but I think the OP was quite set on accepting something - perhaps for closure
@BetaDecay If you pick one turtle and stare at it you'll see that it always faces the same way and only moves along a single straight line, not a curve
@MartinBüttner Action painting has at least made it onto page 1, and it still gets a vote every few weeks...
Pyth, 22 20 bytes
ql{m+=Z*=T^.j)hCdzlz
Try it yourself or run the testsuite.
Note the ASCII values of SRL, respectively 83, 76, 82. I abuse the fact that:
i 83 + 1 = 1
i 76 + 1 = i
i 82 + 1 = -i
From here I just keep a variable for the current position and current direction. For eve...
@orlp That is nifty. The OP seems to be saying it's invalid but doesn't make it very clear why, and doesn't seem consistent with the description in the question, so to me what you have is valid. +1
Right now we have a rule in place that limits answers to language implementations that were made before the question was posted. This makes sense, because otherwise I could invent a programming language after a certain problem was posted that solves the problem in 0 bytes.
However, I feel like a...
Hexagony, 29 Byte
.?'.).@@/'/.!.>+=(<.!)}($>(<%
The readable version of this code is:
. ? ' .
) . @ @ /
' / . ! . >
+ = ( < . ! )
} ( $ > ( <
% . . . .
. . . .
Explanation: It test if there is a number from 2 to n-1 who divides n.
Initialization:
Write n in one memory cell and...
@mbomb007, @NinjaBearMonkey, @randomra, @Sp3000, @TheNumberOne: Another, probably even more important, Retina update: there is a new mode for transliteration now. Given two lists of characters and a regex, do character-wise substitution based on the two lists in all the matches. This finally allows basic character transformations without having to list all of them. (Also let me know if you don't want to be pinged with these updates.)
Given a string P containing n digits and an integer k. A string Q is formed by concatenating k copies of P. How many ways can you remove digits from Q to make it divisible by 5?
Two ways are different,if the deleted positions are different.
Input:
First line containing the number of test cases T....
@minxomat could add some more examples to the bowman challenge? like the expected output when the arrow lands at distance-1, distance or distance+1. also, can the arrow land behind the target? I think you tried to add a rule about that with "no maximum y", but I don't understand it.
@ZachGates It might be worth taking a step back: What are you looking for in solutions to this challenge? What do you want people to implement? For example, are you looking for people to implement one of the below O(n^2) multiplication algorithms, and simply want to close loopholes where people could provide solutions without actually having to implement the algorithm?
@MartinBüttner Hm. distance+1 marks the end of the world, after that everything is a miss. For distance there is already a rule ("arrows falling from the sky onto the target").
@feersum Exactly. Unless it was done before, that would look plenty... challenging (pun intended) to me. I wasn't familiar with those algorithms before, but after following some of the links yesterday, it might make for a fairly difficult but viable challenge. Say you exclude all bigint built-ins and libraries. Allow all operations on word sizes up to 64-bit.
Average Character of a String
code-golf
In this challenge, you will get a string, find the average character code, then the associated character.
Example
Hello, World -> V
We get this by:
72 H
101 e
108 l
108 l
111 o
44 ,
32
87 W
111 o
114 r
108 l
100 d
+ 33 ...
Holy wars have been fought over spaces vs. tabs. (And of course spaces, being
objectively superior, won.) —Alex A.
Some people still refuse to accept that
which is clearly supreme. You've just received
a file using the incorrect, bad, and inferior form
of whitespace, and now the contents o...
Bob the Bowman
o
/( )\ This is Bob.
L L Bob wants to be an archer.
#############
.
/ \ <--- bow So he bought himself a
(c -)-> <--- arrow ...
Hexagony, 29 Byte
.?'.).@@/'/.!.>+=(<.!)}($>(<%
The readable version of this code is:
. ? ' .
) . @ @ /
' / . ! . >
+ = ( < . ! )
} ( $ > ( <
% . . . .
. . . .
Explanation: It test if there is a number from 2 to n-1 who divides n.
Initialization:
Write n in one memory cell and...
Average Character of a String
code-golf
In this challenge, you will get a string, find the average character code, then the associated character.
Example
Hello, World -> V
We get this by:
72 H
101 e
108 l
108 l
111 o
44 ,
32
87 W
111 o
114 r
108 l
100 d
+ 33 ...
Holy wars have been fought over spaces vs. tabs. (And of course spaces, being
objectively superior, won.) —Alex A.
Some people still refuse to accept that
which is clearly supreme. You've just received
a file using the incorrect, bad, and inferior form
of whitespace, and now the contents o...
