0
I square the source code, you square the input!
Blatant rip-off of a rip-off of a rip-off of a rip-off of a rip-off. Go upvote those!
Your task, if you wish to accept it, is to write a program/function that outputs/returns the square of its input/argument1. The tricky part is that if I square3 ...
What general tips do you have for golfing in 1+? I'm looking for ideas which can be applied to code-golf problems and which are also at least somewhat specific to 1+ (e.g. "remove unnecessary whitespace" is not an answer).
Please post one tip per answer.
What general tips do you have for golfing in Keg? I'm looking for ideas that can be applied to code golf problems in general that are at least somewhat specific to Keg (e.g. "remove comments" is not an answer).
Please post one tip per answer.
What is the mean of 'self' in python code?
@view_defaults(renderer='home.pt')
class TutorialViews:
def __init__(self, request):
self.request = request
@view_config(route_name='home')
def home(self):
return {'name': 'Home View'}
@view_config(route_name='hello')
def hello(self):
...
Make it improbable... BUT NOT IMPOSSIBLE
You must make a program that outputs truly once in a while. However, making it have output falsy all the time is not acceptable.
Rules
Standard loopholes are forbidden
...
Title - Fix the note
Given a musical note letter (A to G), followed by any number of accidentals (either 0..n # or 0..n b, not a combination of both); output a representation of the same note with the least possible number of accidentals.
Examples
A -> A
B# -> C
Fb -> E
A##### -> D
Dbbb -> B
...
0
Your task is to create a program that determines whether a given string is a valid regular expression or not using code snippets sourced from sites on the StackExchange network.
For the purposes of this challenge, the regular expression dialect will be a stripped down and mostly minimal set of m...
Starting at 1-TET, give equal temperaments that have better and better approximation of the perfect fifth(just ratio 3/2). (OEIS sequence A060528)
When given an integer n as input, the output must be the first N numbers of the sequence. For example, when n = 7, the output should be:
1 2 3 5 7 1...
