import itertools
def luck(s):
luckn=2**max([j-i for i,j in itertools.combinations(range(6),2)if"lucky"[i:j]in s]+[0])
for c in s:
if c in "omen": luckn -= 2
return luckn
import itertools
def f(s):
n=2**max([j-i for i,j in itertools.combinations(range(6),2)if"lucky"[i:j]in s]+[0])
for c in s:
if c in "omen": n -= 2
return n
Inspired by this challenge
Given a number m, output a program that prints out the string Do not repeat yourself.
Now for the challenging part: Each program the original code prints out has to have the byte at place m*n be the same as m*n + 1 and the same as m*n + 2 .... all the way down to m*n ...
Inspired by this challenge
Given a number m, output a program that prints out the string Do not repeat yourself.
Now for the challenging part: Each program the original code prints out has to have the byte at place m*n be the same as m*n + 1 and the same as m*n + 2 .... all the way down to m*n ...
Your program's input is a string containing whitespaces, parentheses, and other characters. The string is assumed to be parenthesed correctly, i.e. each right parenthesis matches a unique left parenthesis and vice versa : so the program is allowed to do anything on incorrectly parenthesed strings...
oh just wondering. I might do it tomorrow since I have work next week then, or slack off at work when I get bored with the HTML crap they make me do as an intern :P
I call complete BS on the media currently flipping their sh*t about Pokemon Go. People die! Teen discovers body! I mean, there are so much more Ingress players (atm). I don't remember ever reading something like this about Ingress...
Well, PG places Pokemon in ridiculous places (like in the middle of the highway). Ingress places targets at places where humans are supposed to go. So maybe there's something to it.
Inspired by this challenge
Given a number m, output a program that prints out the string Do not repeat yourself.
Now for the challenging part: Each program the original code prints out has to have the byte at place m*n be the same as m*n + 1 and the same as m*n + 2 .... all the way down to m*n ...
Inspired by this challenge
Given a number m, output a program that prints out the string Do not repeat yourself.
Now for the challenging part: Each program the original code prints out has to have the byte at place m*n be the same as m*n + 1 and the same as m*n + 2 .... all the way down to m*n ...
Inspired by this challenge
Given a number m, output a program that prints out the string Do not repeat yourself.
Now for the challenging part: Each program the original code prints out has to have the byte at place m*n be the same as m*n + 1 and the same as m*n + 2 .... all the way down to m*n ...
Decrypt the extended Wechsler format
tags: code-golf [need more tags]
apgsearch, the distributed soup search program for Conway's Game of Life and the search results database, Catagolue use apgcodes to classify and denote patterns. apgcodes themselves use the extended Wechsler format, an exte...