Anyway, now that we've talked about stale sandbox posts and narcissistically answering challenges about yourself, does anyone have an opinion about that Transistor sandbox post?
@quartata I can't even tell how sad it makes me that that's the most important change :D
I think one reason I didn't post it was that I wasn't sure if restricting to N <= 16 would make hardcoding the best solution (as, I think, Peter pointed out)
Python 2, 64,515
Hey, beats the house! (just in one test though; could be a mistake in the test cases?)
Not golfed at the moment.
import sys
input = map(str.rstrip, sys.stdin.readlines())
width = (len(input[-1]) + 1) / 2
for i in range(len(input)):
indent = len(input) - i - 1
input[i]...
The Challenge
The game Light Up! is a simple puzzle game where the objective is to light up every cell in an n-by-n array with light bulbs. However, there are blocks in the way that will prevent light from traveling, and no two light bulbs can be put in the same row or column. Each light bulb ha...
How an emulator-feuled robot reprogrammed Super Mario World on the fly: http://arstechnica.com/gaming/2014/01/how-an-emulator-fueled-robot-reprogrammed-super-mario-world-on-the-fly/
Is it possible to have an image where every pixel is a different color but every 2x2 group of pixels has the same average color? Is the upper limit an image with all colors?
The Challenge
I always write my math assignments down in the same way. For example:
pg. 420: #25, 50-56, 90
pg. 26: #50-60 evens, 70-80 odds, 90-99 3s
pg. 69: #12, 16, 18, 37
But I need you to tell me the individual problem numbers. For example:
input:
pg. 420: #25, 50-56, 90
output:
25, 5...
I want to organise a speeddate event in groups of 3 for a social gathering.
I will have n guests where n = 3 x t, where t is the amount of tables with 3 seats. I will have r rounds of 20 minutes for the 3 guests per table to mingle. Each table has a get to know you game.
Say if n = 15, I have ...
@Sp3000 What it does is generate all possible 2x2 blocks, then sorta-recursively puts any blocks that can fit onto the current structure, building up to full solutions.
Instead of actually being recursive though, it uses a queue.
It's just a list. For the current in-progress solution, I do q = queue.pop(0). I loop through all 2x2 blocks (for p in permutes) and any that fit into the next slot are appended to the queue (queue.append(q+[p])).
Ah yes, I've looked this up before. This is a one-liner for getting a determinant using Dyalog APL: {∇{⍵+(¯1*+/∧\⍺)×⍵⍵[⎕io;⍺⍳0]×⍺⍺ ⍺/1 0↓⍵⍵}⍵/(↓≠/¨⍳⍴⍵),0 0≡⍴⍵}.
So far APL doesn't seem very useful for the string printer challenge since it does nice things like "[...30 lines of output...]" and scientific notation
def firstSoln(n):
for p in itertools.permutations(range(n**2), n**2):
grid = [list(p[i*n:(i+1)*n]) for i in range(n)]
sums = set()
for y in range(n-1):
for x in range(n-1):
sums.add(grid[y][x] + grid[y+1][x] + grid[y][x+1] + grid[y+1][x+1])
if len(sums) == 1:
return grid
A coworker recently wrote a program in which he used a Python list as a queue. In other words, he used .append(x) when needing to insert items and .pop(0) when needing to remove items.
I know that Python has collections.deque and I'm trying to figure out whether to spend my (limited) time to re...
@quartata You can also use an array as the left argument to thorn. In that case, the first element of the array is the total width of the output string and the second is the number of decimal places. If the allocated length is insufficient to display the number, you get asterisks.
@Sp3000 No, I stopped it to see if n=5 gave a quick answer. But I'm not sure if this brute force for n=4 is viable. There are 16! = ~10^13 permutations to check.
Python 2, 64,515
Hey, beats the house! (just in one test though; could be a mistake in the test cases?)
Not golfed at the moment.
import sys
input = map(str.rstrip, sys.stdin.readlines())
width = (len(input[-1]) + 1) / 2
for i in range(len(input)):
indent = len(input) - i - 1
input[i]...
Given (by any means) two different natural numbers, output (by any means) the square of their sum as in the examples below:
Given 4 and 3, output:
12 12 12 12 9 9 9
12 12 12 12 9 9 9
12 12 12 12 9 9 9
16 16 16 16 12 12 12
16 16 16 16 12 12 12
16 16 16 16 12 12 12
16 16 16 16 12 12 12
...
The Challenge
I always write my math assignments down in the same way. For example:
pg. 420: #25, 50-56, 90
pg. 26: #50-60 evens, 70-80 odds, 90-99 3s
pg. 69: #12, 16, 18, 37
But I need you to tell me the individual problem numbers. For example:
input:
pg. 420: #25, 50-56, 90
output:
25, 5...
I want to organise a speeddate event in groups of 3 for a social gathering.
I will have n guests where n = 3 x t, where t is the amount of tables with 3 seats. I will have r rounds of 20 minutes for the 3 guests per table to mingle. Each table has a get to know you game.
Say if n = 15, I have ...
