Have a single class, with all of the necessary methods, and a single method called invoke with a switch/case statement inside. That, or lambda expressions.
You can treat arbitrary things as a Method. You just extend Method.
Actually, the more I think about it, the more I see problems with extending method, least of all making your code unreadable. Which TBH would mostly be a lateral move.
You've recently made an account on a dodgy gambling site, where for a fee of 25 dollars, they will pay you back a random amount between 0 and 50 dollars. After getting around 5 dollars twice, you decide to prove the site is a scam. After accessing their external firewall with the default password...
Starry Starry Night
This challenge needs a lot of work in my opinion, especially refining rules on input-output, I want to leave it as open as possible, while excluding unfair methods such as pre-drawn graphs etc.
some parts of this are currently extremely vague, please ask any questions you be...
Associativity Conversion
code-golfsyntaxbalanced-string
Operators that aren't associative usually come with some implicit associativity which let you omit parentheses in some expressions for readability. E.g. for a left-associative operator $, the following parentheses are assumed:
a $ b $ c $...
@KritixiLithos That was my whole point with the long expression; I've been challenging myself to actually define real numbers in terms of sets. The long expression itself is simply the integer 0 defined as a set. The actual values in the set are {{{{}}}, {{{{}}}}, {{{{}, {{}}}}}, {{{{}, {{}}, {{}, {{}}}}}}, ...}
So yeah. 0 as a natural number is {}, 0 as an integer is that thing, 0 as a rational number is more complicated and requires weird field theory, and 0 as a real number is even more complicated
@wat if it helps at all, mine just logs in to the regular login page with Mechanize and retrieves the fkey. Should work with the Google login thing if you just tell it to press that button first
Start from ones(dupe?)
code-golfarithmeticany tag for formatted output?
Given a number N, start by printing N space-separated ones in a row, then continue as the below examples do.
Example: 1
1
Example: 4
1 1 1 1
2 2
4
Example: 13
1 1 1 1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 1
4 4 4 1
8 5
13
...
Just had an idea: To prevent myself from getting golfed before I reach a challenge, I should come up with the answers while the challenges are still in the Sandbox
Hmm, wasn't it recently discovered that Java's type system is actually unsound (i.e. becomes internally inconsistent, given sufficiently insane code)? That might negate that result, because it likely relies on soundness of the type system (not sure, though)
Yeah, you can cause a List<Integer> to contain various kinds of stuff that aren't integers, and it only throws a fun runtime exception when you try to pull them out.
You're given a semiprime N. Your task is to find the smallest positive integer m such that the binary representation of one of the two factors of N can be found in the binary representation of N * m.
Example
Let's consider the semiprime N = 9799.
We try different values of m, starting at 1:
...
@MatthewRoh it might be worth me linking you to Element, my first language. It uses a couple stacks to store stuff, and if you look over the interpreter you can see how each command in the language corresponds to a block of Perl code, which is evaluated.
Self-Destruct Quine
Write a quine that returns/prints itself missing 1 or more characters. The outputted program must do the same thing as the original. It must generate new programs until it generates an empty program, and at least 2 new programs must be generated. Destroying comments is not al...
Associativity Conversion
code-golfsyntaxbalanced-string
Operators that aren't associative usually come with some implicit associativity which let you omit parentheses in some expressions for readability. E.g. for a left-associative operator $, the following parentheses are assumed:
a $ b $ c $...
Start from ones(dupe?)
code-golfarithmeticany tag for formatted output?
Given a number N, start by printing N space-separated ones in a row, then continue as the below examples do.
Example: 1
1
Example: 4
1 1 1 1
2 2
4
Example: 13
1 1 1 1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 1
4 4 4 1
8 5
13
...
You're given a semiprime N. Your task is to find the smallest positive integer m such that the binary representation of one of the two factors of N can be found in the binary representation of N * m.
Example
Let's consider the semiprime N = 9799.
We try different values of m, starting at 1:
...
