nah, the problem is that the ideal input format specifies the number of mines on each square and the number of mines surrounding each square, specifying them as a variable if unknown, and has a border of known-nonmine-unknown-minecount surrounding the whole grid
and I felt that requiring the input to be in that form was unreasonable
this would have been a lot easier if Prolog had basic functional primitives
but it doesn't even have map, and although it's easy to write, it cuts too much into your bytecount unless you're going to use it 3 or 4 times
maybe I should write a golfing version of Prolog with terser syntax and a better standard library (not Brachylog; I can't figure out how to write anything nontrivial in it)
@mınxomaτ things are only TC if they're capable of accepting more time and memory, though; for example, C is TC because it can store things on the filesystem
Count the reviews!
code-golf array-manipulation
Introduction and Credit
Imagine you're Amazon. Imagine you have a large number of products for which a lot of people have written reviews scoring 1-5 stars. Now you need to give your customers a summary for each product based on the simple prod...
@ETHproductions you can handle loops by getting the user to click a button repeatedly (I think that's reasonable), but you have to bound the size of the loop in advance
HTML+CSS, 254+nmax*28 bytes
We can check primality using regular expressions. Mozilla has @document, which is defined as:
@document [ <url> | url-prefix(<string>) | domain(<string>) | regexp(<string>) ]# {
<group-rule-body>
}
To filter elements via CSS based on the current URL. This is a si...
(the difference is that a primitive recursive language doesn't have infinite loops, any time you start a loop you have to declare the max number of iterations in advance)
My teacher was more than unhappy with my Martian Homework. I followed all the rules, but she says that what I output was gibberish... when she first looked at it, she was highly suspicious. "All languages should follow zipf's law blah blah blah"... I didn't even know what zipf's law was!
It turn...
.toSource is quite a bit different in that it wraps the data in (new Whatever()), unless it's an array or object literal, in which case it acts like uneval
@DJMcMayhem I knew about <backspace><backspace><backspace><backspace><backspace><backspace><backspace><backspace><backspace><backspace><backspace><backspace><backspace>
@ETHproductions +1 this is good
though changing vfuse will probably break a lot of things
Hi everyone! I have a question - if I post an asynchronous function as an answer to some code golf, should I add the overhead required to call it (in that case, Async.Start in F#) to the byte count? I could not find anything related to this topic on meta.
When faced with similar problems in the past when posting questions I generally figured "I don't care, so let there be one language where the problem is trivial but the fun about this is the myriad of solutions in languages where it's not trivial"
(at least) three of my 6 questions had answers with built-ins that made the problem trivial
Is there a way to conveniently define a C-like structure in Python? I'm tired of writing stuff like:
class MyStruct():
def __init__(self, field1, field2, field3):
self.field1 = field1
self.field2 = field2
self.field3 = field3
Just create a pointer, assign the data afterwards;
import ctypes
class EmxArray(ctypes.Structure):
""" creates a struct to match emxArray_real_T """
_fields_ = [('data', ctypes.POINTER(ctypes.c_double)),
('size', ctypes.POINTER(ctypes.c_int)),
('allocate...
Use a named tuple, which was added to the collections module in the standard library in Python 2.6. It's also possible to use Raymond Hettinger's named tuple recipe if you need to support Python 2.4.
It's nice for your basic example, but also covers a bunch of edge cases you might run into later...
:33894686
def chunk(self, inp:Node.indexable, size:Node.number):
"""Return inp seperated into groups sized size"""
size = float(size)
rtn = []
last = 0
for i, val in enumerate(inp):
cur = i%size
if cur <= last:
if len(rtn):
if isinstance(inp, str):
rtn[-1] = "".join(rtn[-1])
else:
rtn[-1] = type(inp)(rtn[-1])
rtn.append([])
Count the reviews!
code-golf array-manipulation
Introduction and Credit
Imagine you're Amazon. Imagine you have a large number of products for which a lot of people have written reviews scoring 1-5 stars. Now you need to give your customers a summary for each product based on the simple prod...
HTML+CSS, 254+nmax*28 bytes
We can check primality using regular expressions. Mozilla has @document, which is defined as:
@document [ <url> | url-prefix(<string>) | domain(<string>) | regexp(<string>) ]# {
<group-rule-body>
}
To filter elements via CSS based on the current URL. This is a si...
Is there a way to conveniently define a C-like structure in Python? I'm tired of writing stuff like:
class MyStruct():
def __init__(self, field1, field2, field3):
self.field1 = field1
self.field2 = field2
self.field3 = field3
Just create a pointer, assign the data afterwards;
import ctypes
class EmxArray(ctypes.Structure):
""" creates a struct to match emxArray_real_T """
_fields_ = [('data', ctypes.POINTER(ctypes.c_double)),
('size', ctypes.POINTER(ctypes.c_int)),
('allocate...
