Challenge :
Given a number N and another number P , find the biggest integer M such that P ^ M ≤ N.
I&O :
Input is given as 2 integers N and P while output will be integer N. (You can replace the names with what you want). First value is N and second value is P
Examples :
33 , 5 ...
Clebsch-Gordon coefficients
Clebsch-Gordon coefficients are numbers that arise when adding two quantum mechanical angular momenta.
If an angular momentum has magnitude j, where j must be a nonzero integer or positive half integer (0, 1/2, 1, 3/2, 2, ...) then its z component m can take on any v...
@EriktheOutgolfer To avoid consuming the second input, change [{}] into [({})] (peek instead of pop). Keeping the first around's a bit harder, but you can do it by duplicating it onto the third stack: (({})<blah blah>)
Although I think if you do both of those, it'll put the output between the two inputs, so a, b would become a, a==b|a!=b, b
@user202729 Wow, nice. The output is reversed, so that's +18 you need to fix it. I used the not equals from the wiki without thinking, so that's the rest of the byte difference in my solution. Other than that, are solutions are identical
@user202729 Actually, when you factor in my different not equals and the reverse at the end, are solutions are literally byte for byte. Even down to little things like using the return value of <> to break the loop. Cool how that worked out
I'm not saying it's your job or anything. I'm just saying if you dislike the title, you're welcome to improve it. Or downvote it if you don't feel like it :shrug:
@betseg Because scripts written before Python3 referenced Python2 as Python and they don't woant to break it. Python2 has been deprecated for a while and python will point to python3 in the next release iirc
@DJMcMayhem that was too brash of an action on removing ALL of those comments. Many of them were legitimate comments that weren't part of any conversation
IMO :)
there were definitely conversations in there, but there were many comments that pointed out significant issues that really should be kept on the challenge
@NathanMerrill I'm on the edge for that challenge. I haven't read the spec (or the controller) that closely, but if it really needs that many comments for clarification I'd say the challenge is unclear
It's also horribly unclear what is or isn't allowed (without reading/testing the controller). The Darth Vader submission is clearly sabotaging other bots/breaking the controller, but I think it's allowed? Though it doesn't seem to work
Palindromic Programming
code-bowling
In English (And other languages), a palindrome is a word that is the same read backwards. This is your challenge: to build a program that is the same run backwards. For example:
var rav
f4x0 = 0x4f
/racecar/
But one potential problem would be a string, re...
Did you obtain permission from the American Association of Anti-Aliased ASCII Aureoles and Areolas (AAAAAAA) to use their logo? — COTOOct 9 '14 at 10:54
I decide to not limit in "golfing" because when using unary it's usually not a pure-golfing.
For golfing tips that also apply for brainfuck, answer here
Here also discuss when it is suitable to use unary/lenguage
Introduction
A childhood game designed to help children learn to count in french in Canadian schools is played as follows:
Students go around the room counting up to 11
A number greater than 11 cannot be said
A student can say either 1, 2, or 3 numbers
If a student says the number 11 then they...
Is it a bad idea to make a king-of-the-hill where the game that the bots are playing involves randomness? For example, Poker? (Not actually the game I'm thinking of, just an equivalent example)
I think you should run it enough times such that the leaderboard doesn't actually change, at least near the top
So if you get a histogram of the score of each player after many runs, for each player the center of all other player's histograms is outside of 1 sigma of it's own center
Anyway, it's basically a card game of wagering and deception. You wager cards from your hand to earn revealed cards, and with each wager the cost to stay in the next round goes up. But you don't have to tell the truth about the card you wagered
Here is a sequence of 1000 numbers generated using 3 lines of Python (78 characters). I'd ask you find the rule, or to find another rule that produces the sequence of numbers in less space.
Here are the first 1000 numbers of a sequence. What was the rule?
[0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, ...
@totallyhuman I know. that rule is being followed. It just feels different when the user has been banned, and decided to not participate on the site due to that
The Top Ten Elements You Wouldn't BELIEVE Are In This Array
code-golf array-manipulation
AKA: Generate Clickbait From an Array.
Given an array of integers, generate some cringe-worthy clickbait based on its arrangement and length:
If it's 20 elements or less, you can make a Top X List.
Pri...
tfw you lock yourself out of your steam account after trying your pswd 20 times, being very worried about it being stolen, resetting your password, and then finding out you just suck at typing
“I thought of a ‘prime FizzBuzz’ challenge: print all the prime numbers up to 100, but replace every multiple of 3 with ‘Fizz’, and every multiple of 5 with ‘Buzz’, and every multiple of both with ‘FizzBuzz’.” — @henkma twitter.com/henkma/status/189716348392321025
I was looking through "@henkma fizzbuzz" on Twitter for… something
also trying to read anagol twitter is sort of fun
also the Hello World challenge was a wild rush of me poking at the whitespace and syntax in Hello World programs in like a couple dozen languages I don't really know
twitter.com/henkma/status/115431299824623617 “The 82-byte FizzBuzz answer is sort of normal, but also sort of not. Maybe notogawa-san feels the same way… It might be abnormal depending on who you ask. I'd like to see the rumored 84-byte solution.” hmmmm
Challenge :
Given a number N and another number P , find the biggest integer M such that P ^ M ≤ N.
I&O :
Input is given as 2 integers N and P while output will be integer N. (You can replace the names with what you want). First value is N and second value is P
Examples :
33 , 5 ...
Clebsch-Gordon coefficients
Clebsch-Gordon coefficients are numbers that arise when adding two quantum mechanical angular momenta.
If an angular momentum has magnitude j, where j must be a nonzero integer or positive half integer (0, 1/2, 1, 3/2, 2, ...) then its z component m can take on any v...
Palindromic Programming
code-bowling
In English (And other languages), a palindrome is a word that is the same read backwards. This is your challenge: to build a program that is the same run backwards. For example:
var rav
f4x0 = 0x4f
/racecar/
But one potential problem would be a string, re...
I decide to not limit in "golfing" because when using unary it's usually not a pure-golfing.
For golfing tips that also apply for brainfuck, answer here
Here also discuss when it is suitable to use unary/lenguage
Introduction
A childhood game designed to help children learn to count in french in Canadian schools is played as follows:
Students go around the room counting up to 11
A number greater than 11 cannot be said
A student can say either 1, 2, or 3 numbers
If a student says the number 11 then they...
Here is a sequence of 1000 numbers generated using 3 lines of Python (78 characters). I'd ask you find the rule, or to find another rule that produces the sequence of numbers in less space.
Here are the first 1000 numbers of a sequence. What was the rule?
[0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, ...
The Top Ten Elements You Wouldn't BELIEVE Are In This Array
code-golf array-manipulation
AKA: Generate Clickbait From an Array.
Given an array of integers, generate some cringe-worthy clickbait based on its arrangement and length:
If it's 20 elements or less, you can make a Top X List.
Pri...
