Anyway, we've ostensibly graduated, but we're waiting on changes to site text and UI that will better support our focus on challenges, and then we'll get our design.
@Poke Well it's not the first time I've said the design comes in November. It's just the first time I felt comfortable giving specifics. I'm just not sure how much I'm allowed to say.
@EᴀsᴛᴇʀʟʏIʀᴋ Yea, I'm not sure how to word it better. Basically it will eventually change to the new color, but in very small steps, one day at a time. The goal is to confuse the users about when exactly it changed, making it a puzzle, keeping with our theme.
So, someone who's not been on the site in a while will come back, see the background color has changed, go in chat like "OMG, we got our design!" and everyone else is like "lolwut?"
Occasionally I see other users posting links to their own answers or challenges in The Nineteenth Byte. Is this OK? Can I promote my own posts as well?
If you open up a new room, I think it would be fine to let others know about it. I don't think it's necessary or polite to promote it regularly, though. Of course, if people are talking about nethack, something like "we can take this to the nethack room (link)", would be fine
Challenge idea: You have a 2D grid of size N*N. Each point in the array needs a unique integer number. For each pair of adjacent points, the "adjacency cost" is abs(A-B)^2. You need to minimize the total adjacency cost for the entire grid
@Geobits Well, obviously, that minimizes the horizontal rows. You can't do better than 1 difference each pair horizontally, so your minimum for each row is n-1.
Ok, so obviously we can minimize the horizontal rows by incrementing across. Since they all have to be unique, the minimum total difference we can get for the next row is 3*n, which follows page reading order. I don't see how it can get any better.
Jelly is one of those languages that doesn't use ANSI text in its code. Why should we score Jelly by its character count when each character can take up to 4 bytes?
For example, take this answer (Authored by Dennis):
ḃ2-*µSN;+\>-Ạ
1Ç#Ṫḃ2ṭ2;1ị⁾][
From a character counter, one can see that this...
The worst part about ignoring someone is when you end up confused about the conversation, and then have to ask what was said, derailing the whole thing. Which wouldn't have happened if they weren't ignored.
@Downgoat but that doesn't work everywhere. that's what i meant by shim. jquery does it for everything else, like key events and stuff, but not oninput
C++
My approach is quite slow, but I'm very happy with quality of the results that it gives, particularly with respect to preserving edges. For example, here's Yoshi and the Cornell Box with just 1000 sites each:
There are two main parts that make it tick. The first, embodied in the evalua...
You have been hired for your tech knowledge as a Secret Agent's sidekick to ensure that the good guy can get his job done and the world can be saved.
This is your last mission before retiring with a high paycheck and the gratitude of the whole world. But before you have to disarm the Evil Genius...
-1: doesn't include the ; line ending that is required for many languages, not to mention , these challenges are typically not well received in the first place... — tuskiomi2 hours ago
Given a atomic number N (1 <= N <= 118), print information about the element that the atomic number corresponds to. This includes:
Element name
Atomic mass
Electron configuration
Examples
Input -> Output
1 -> Hydrogen, 1.00794, 1s^1
56 -> Barium, 137.327, [Xe] 6s^2
etc.
Remember, this is c...
Tell Me About This Element: yeah I doubt Mathematica can be beaten unless another language has a built in that does it - I was just about to post a boring 83 byte answer
@ConorO'Brien rails is the name of a library for building websites
Jelly, 7 6 bytes
-1 byte thanks to @Dennis (convert from unary ḅ1, rather than sum for each for each S€€)
1ẋŒṖḅ1
TryItOnline
How?
1ẋŒṖḅ1 - Main link: n e.g. 4
1ẋ - repeat 1 n times [1,1,1,1]
ŒṖ - partitions of a list [[[1],[1],[1],[1]], [[1],[1],[1,1]], [[1],[1...
@orlp TP++ will cause a tragic event anywhere in the world. Options include school shooting, bombing, and even plane attack on the World Trade Center. Only $50 a month!
@Downgoat did any of the things mentioned work? Maybe you can install a rootkit as a workaround.
Your challenge is simple: GIven an integer N, ouput every list of positive integers that sums to N. For example, if the input was 5, you should output
[1, 1, 1, 1, 1]
[1, 1, 1, 2]
[1, 1, 3]
[1, 2, 2]
[1, 4]
[2, 3]
[5]
These lists do not have to be output in any particular order, nor do the nu...
Occasionally I see other users posting links to their own answers or challenges in The Nineteenth Byte. Is this OK? Can I promote my own posts as well?
Jelly is one of those languages that doesn't use ANSI text in its code. Why should we score Jelly by its character count when each character can take up to 4 bytes?
For example, take this answer (Authored by Dennis):
ḃ2-*µSN;+\>-Ạ
1Ç#Ṫḃ2ṭ2;1ị⁾][
From a character counter, one can see that this...
C++
My approach is quite slow, but I'm very happy with quality of the results that it gives, particularly with respect to preserving edges. For example, here's Yoshi and the Cornell Box with just 1000 sites each:
There are two main parts that make it tick. The first, embodied in the evalua...
Given a atomic number N (1 <= N <= 118), print information about the element that the atomic number corresponds to. This includes:
Element name
Atomic mass
Electron configuration
Examples
Input -> Output
1 -> Hydrogen, 1.00794, 1s^1
56 -> Barium, 137.327, [Xe] 6s^2
etc.
Remember, this is c...
Jelly, 7 6 bytes
-1 byte thanks to @Dennis (convert from unary ḅ1, rather than sum for each for each S€€)
1ẋŒṖḅ1
TryItOnline
How?
1ẋŒṖḅ1 - Main link: n e.g. 4
1ẋ - repeat 1 n times [1,1,1,1]
ŒṖ - partitions of a list [[[1],[1],[1],[1]], [[1],[1],[1,1]], [[1],[1...
