There's an App SE Site for that
code-golfkolmogorov-complexityinternetstack-exchange-apifile-system
Oftentimes, when searching through StackExchange, I find myself seeking to post a question about something or another, but not knowing where to post it. That's where you come in.
The Challenge
...
I like how the front page has 3 out of 6 top network users from PPCG, and that the number 1 top network user has a profile pic of the "graduated" PPCG upvote.
Monophonic Pitch Detection
Tags: code-challenge test-battery
Sandbox Notes
Still in progress. I haven't made any of the test cases or snippets yet.
This is intended to be an easier and more accessible alternative to Polyphonic Pitch Detection.
Take an array of samples, and output the freq...
> This site requires Sun Java 6.0.0.1 (32-bit) or higher. You have Macromedia Java 7.3.8.1¾ (48-bit). Click here [link to java.com main page] to download an installer which will run fine but not really change anything.
The cross product of two three-dimensional vectors a and b is the unique vector c such that:
c is orthogonal to both a and b
The magnitude of c is equal to the area of the parallelogram formed by a and b
The directions of a, b, and c, in that order, follow the right-hand rule.
There are a few...
Open the box
code-golf ascii-art string
Given an ASCII-art box, your program must open it:
Examples
-------
| |
|_____|
/
/
/
/
/
/
/
| |
|_____|
Specification
The first line will only consist of -, at least 3 of them
The middle rows will start with | have s...
Actually, @quartata, that question has a specific input format and other restrictions. It may be worth to write a new challenge and close the other one.
TL;DR: They are duplicates. Close the old one.
First, I'd like to clarify that I do think the questions are duplicates. I agree with Peter that a difference in the output format counts as a "minor modification" to existing answers, unless the output formatting is the core of the challenge (which...
> Here is Bill Jones' solution in APL. I found it amusing that he sent me this by e-mail even with the difficulty of transliteration and the fact that his office is across the hall from mine.
On an unrelated note, the only Best Of category that still has an uncertain result is Rookie of the Year, with two entries tied for first. I haven't voted for either of them yet. Hmm...
Inverse N-Bonacci
In his Print the N-Bonacci Sequence, @DJMcGoathem describes the N-bonacci sequence: a sequence in which instead of summing the previous two numbers like the traditional Fibonacci sequence (said to also be "duonacci"), you sum the previous n numbers.
He then asked to take two in...
@Cyoce this would drastically change the challenge, but another interesting way to do it would be print out all the n's where each number shows up in the N-bonacci.
So for example, an input of 5 would equal 2, 3, and 5.
I feel like in some languages/approaches this would be as easy as changing if to while, or print to return, while in other languages it would make it near impossible
Yeah that's a good point. Although it does depend on what you're looking for. For example, a sequence can only show up one time. However, each number can show up in different places many times.
So for example, an input of 5, 9 would give 3 and 5. even though {5, 9} only appears in 5-Bonacci.
This challenge is very simple and I'm surprised that it hasn't been done before. You just have to calculate the cross product of two 3D input vectors.
The formula for the cross product is given by:
a x b = (a2*b3 - a3*b2)i + (a3*b1 - a1*b3)j + (a1*b2 - a2*b1)k
where <a1, a2, a3> and <b1, b2, b3>
@Doorknob thanks :) ... I was hoping I'd get it with a more interesting challenge, but then I didn't wanna wait posting more challenges before I came up with something special :D
@DJMcGoathem Ask @MartinBüttner. He knows about this kind of badges. He has even received the rarest badge on PPCG, Copy Editor, and he owns the only copy of that badge.