I have a really weird problem where my game in Processing/java is taking half a second or so to print a single frame, but when subtract the time at the beginning of my "do stuff each frame" loop from the time at the end, the most I get is 21 milliseconds or so, and even then it's rare - mostly 0 or 1
Given a positive square number as input. Output the number of values between the input and next highest square.
Example
Input: 1
Output: 2
Reason: The numbers 2 and 3 are between 1 and 4, the next highest square
Input: 4
Output: 4
Reason: The numbers 5, 6, 7, 8 are between 4 and 9
Pleas...
Am I a special N-bonacci number? code-golf, fibonacci
The N-bonacci sequence, originally invented by @DJMcMayhem in this question, is a sequence generated by starting with the integers 0 and 1, and then adding the previous N numbers to generate the next number. The special N-bonacci sequence is...
@LeakyNun Hahaha, I once had a dream that I went mountain climbing around the world, and for some strange reason I happened to run into El'endia Starman while I was up there. And somehow I could tell it was him, IDK
Although once a friend of mine found brain-flak (I never told him about it, and he never knew my username) and he realized it was me and asked me about it, then joined PPCG.
See main post here
This [question] is intended as community submission describing the target functionality. This will likely change over time, but it will allow devs to have a end goal with their program. Obviously, this includes the standards (doing anything you would normally be able to do ...
Take a positive integer n as input, and output a n-by-n checkerboard matrix consisting of 1 and 0.
The top left digit should always be 1.
Test cases:
n = 1
1
n = 2
1 0
0 1
n = 3
1 0 1
0 1 0
1 0 1
n = 4
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
Input and output formats are optional. Outputting the ...
@Downgoat that's the function signature? Not knowing the language, I'd interpret it as either "f takes an a, casts it to b, and binds C to that" or as "f takes an argument named a to the caller, binds it to b in the scope of the function, and the argument has type C"
Presumably it's more useful if b is a destructuring expression or something.
But it works either way, treating (getting used to) as a single compound that could probably be rendered as "adaptation" or "familiarization" without significantly changing the meaning.
Compute OEIS A005434
Consider a binary string S of length n. Indexing from 1, we can determine if S[1..i+1] matches S[n-i..n] exactly for all i in order from 0 to n-1. For example,
S = 01010
gives
[Y, N, Y, N, Y].
This is because 0 matches 0, 01 does not match 10, 010 matches 010, 0...
@Downgoat feature-request: Make the bytecount guesser in the PPCG Graduation Userscript account for commas. Currently, 1,356 bytes as a bytecount will make the userscript think it's 356 bytes.
user165474
@Lembik I'm apparently visually impared ಠ_ಠ yeah it was that one
Hm. Yeah I personally think it would be different enough. I'd wait though for someone else to look at it because I don't necessarily have the best judgement :P
We need 3-4 casts though: compile time cast, cast which returns null if fails, and dynamic (runtime) cast, (maybe even a runtime cast that is validated to never fail at compile time)
We allow both programs and functions. Some challenges, mostly kolmogorov-complexity challenges, do not require input. This means that for some challenges you can write a function that takes no input. In many languages this is rather straight forward. For example if a challenge asked you to out...
Things like Int::myDouble (compile-time), and let maybeWasDowncast: Goat? = myAnimal as? Goat (optional, returns nil if cast fails). then myAnimal as! Goat will bork if cannot be downcast. myAnimal as Thing will work for upcast and you have no fear of bork because compiler checks that it can always work
Am I a Cullen Number? code-golf number math
A Cullen Number is any number that is contained in the sequence generated using the formula C(n) = (n*2^n)+1.
Your Task:
Write a program or function that receives an input and outputs a truthy/falsy value based on whether the input is a Cullen Numb...
C++ question: Lets say I have a function void foo(int a) that has to take an int so that it can be stored in a std::map<int, std::function<void(int)>>, but it doesn't actually need the int. How can I signal to the compiler that I need to take 'a', but don't plan on using it so that I don't get warning C4100: 'a': unreferenced formal parameter?
@NathanMerrill I mean it's not overflow safe etc. but Int::myDouble will always be able to work. If I do myAnimal as Goat, myAnimal could be Dog in which there is no way of interpreting that as a Goat
@Lembik I'm not sure what happens if you #include <cstdint> and then declare a uint64_t in code that's going to be compiled by a pre-C++11 C++ compiler.
@Lembik looking at stdint.h, and boost cstdint.hpp, it looks like the answer is "depending on the exact header and compiler in use, you either get long int, you get a compile-time error because it tries to be long long int, or you get a compile-time error because uint64_t isn't defined"
At least on *nix, I have no idea if windows even has <stdint.h>
Question: is there a FAQ somewhere that digs into the details of the different types of puzzles/contests questions that PPCG allows/supports? You know, [code-golf] vs [popularity-contest] vs [fastest-code]?
@Lembik it looks like gcc 4.5 added a builtin <stdint.h> for platforms where libc doesn't have one, but that was in 2010; it showed up in various libc implementations long before
Solve an Anagram [code-golf], [permutation], [string]
You will be given a string of lowercase ASCII letters. Using this dictionary file (link to be posted), your task is to solve the anagram. To solve an anagram, you must output all words or sets of words that can be formed using each letter fro...
Given a positive square number as input. Output the number of values between the input and next highest square.
Example
Input: 1
Output: 2
Reason: The numbers 2 and 3 are between 1 and 4, the next highest square
Input: 4
Output: 4
Reason: The numbers 5, 6, 7, 8 are between 4 and 9
Pleas...
Am I a special N-bonacci number? code-golf, fibonacci
The N-bonacci sequence, originally invented by @DJMcMayhem in this question, is a sequence generated by starting with the integers 0 and 1, and then adding the previous N numbers to generate the next number. The special N-bonacci sequence is...
See main post here
This [question] is intended as community submission describing the target functionality. This will likely change over time, but it will allow devs to have a end goal with their program. Obviously, this includes the standards (doing anything you would normally be able to do ...
Take a positive integer n as input, and output a n-by-n checkerboard matrix consisting of 1 and 0.
The top left digit should always be 1.
Test cases:
n = 1
1
n = 2
1 0
0 1
n = 3
1 0 1
0 1 0
1 0 1
n = 4
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
Input and output formats are optional. Outputting the ...
Compute OEIS A005434
Consider a binary string S of length n. Indexing from 1, we can determine if S[1..i+1] matches S[n-i..n] exactly for all i in order from 0 to n-1. For example,
S = 01010
gives
[Y, N, Y, N, Y].
This is because 0 matches 0, 01 does not match 10, 010 matches 010, 0...
What's the meaning of ~> version requirement in gem specs?
hanna-0.1.12 depends on [haml (~> 2.2.8)]
We allow both programs and functions. Some challenges, mostly kolmogorov-complexity challenges, do not require input. This means that for some challenges you can write a function that takes no input. In many languages this is rather straight forward. For example if a challenge asked you to out...
