This room was placed in timeout for 1 minute; the topic of this room is "General discussion for http://codegolf.stackexchange.com | abandon all work, ye who enter here —aditsu" - conversation should be limited to that topic.
@ConorO'Brien Timeouts are the last resort with which moderators can attempt to keep a room under control. You don't place clown masks on the riot police, and you don't crack jokes in a timeout message.
All credits to Adnan for coming up with this challenge.
My last challenge, before I go on break.
Task
Given positive integer n, if n is odd, repeat / that many times; if n is even, repeat \ that many times.
(Seriously, the testcases would be much clearer than this description, so just look at...
/* Thirst tick. Called from moveloop(). */
void qnh_do_thirst() {
if (u.uinvulnerable) {
return;
} else if ((!u.usleep || !rn2(10)) && amphibious(youmonst.data)) {
/* You can only get thirsty if you can breathe. */
u.uthirst -= abs(tan(u.uthirst));
if (u.uthirst < 0) {
You_feel("deathly dehydrated.");
qnh_thirst_dying();
} else if (u.uthirst < 100) {
You_feel("quite thirsty.");
}
}
}
Sylvester's sequence, OEIS A000058, is an integer sequence defined as follows:
Each member is the product of all previous members plus one. The first member of the sequence is 2.
Task
Create the smallest program possible that takes an n and calculates the nth term of Sylvester's Sequence. St...
Introduction
A quixel is a quantum pixel. Similar to a classical pixel, it is represented with 3 integer values (Red, Green, Blue). However, quixels are in a super position of these 3 states instead of a combination. This super position only lasts until the quixel is observed at which point it c...
Oasis, 4 bytes (non-competing)
Probably my last language from the golfing family! Non-competing, since the language postdates the challenge.
Code:
²->2
Expanded version:
a(n) = ²->
a(0) = 2
Explanation:
² # Stack is empty, so calculate a(n - 1).
- # Subtract, arity 2, so use a(n - ...
@Dennis does jelly programs for kolmogorov comprexity challenges on a large selection of english plain text do significantly better in comparison to standard compression techniques?
@Dennis Staying in the "things that go with peanut butter" theme, you could name it Jam. But it would probably be better if you made it clear it was for coding, so maybe CJam.
@Dennis I always find it interesting that golfing languages, are comparible in their ability to exploit patterns than most standard compression libraries
@RohanJhunjhunwala Not really a fair comparison, considering zip et al. don't have a built-in dictionary. Would be interesting to compare it to Brotli though.
Shift and Sum
(I need a better title)
Write a program or function that given an input list of integers of length l, outputs the sum of all the lists of length 2*l-1 that are the input list padded with 0s to each side.
(Please suggest ways of improving this description)
For example, with the i...
@ConorO'Brien I'm not really sure. If you can demonstrate you've got something to contribute, then that should help a lot. It'll probably still take a while for them to approve the account. Took like 2 weeks or something for me.
Yeah, this is why I didn't bother with an OEIS golfing language :P, although... @Dennis Feature request: generating function to series coeffs please :D
I'm pretty confident I can stay ahead of the Main bot for another year or more. I'm surprised Meta is so high, though. I thought they were created around the same time, and Main should definitely be more active than Meta.
Oooooh, Meta is a year older, so that makes sense.
When I run:
new ProcessBuilder("kotlinc", "file.kt").start();
I get the error: Cannot run program "kotlinc": CreateProcess error=2, The system cannot find the file specified
I've tried:
If I check my path from windows, it contains C:\Apps\kotlinc\bin, and when I open explorer at that locati...
Sylvester's sequence, OEIS A000058, is an integer sequence defined as follows:
Each member is the product of all previous members plus one. The first member of the sequence is 2.
Task
Create the smallest program possible that takes an n and calculates the nth term of Sylvester's Sequence. St...
Oasis, 4 bytes (non-competing)
Probably my last language from the golfing family! Non-competing, since the language postdates the challenge.
Code:
²->2
Expanded version:
a(n) = ²->
a(0) = 2
Explanation:
² # Stack is empty, so calculate a(n - 1).
- # Subtract, arity 2, so use a(n - ...
When I run:
new ProcessBuilder("kotlinc", "file.kt").start();
I get the error: Cannot run program "kotlinc": CreateProcess error=2, The system cannot find the file specified
I've tried:
If I check my path from windows, it contains C:\Apps\kotlinc\bin, and when I open explorer at that locati...
