Write a program/method that becomes a quine if and only if the input matches the source code.
If the input doesn't match the source code, the program is in don't care situation except it cannot be a quine. (Hint: Falling into an infinite loop makes the program a non-quine.)
Generator functions to solve combinatorics problems
This is a code-golf and math challenge that came to life after some input on my sandboxed challenge for symbolic differentiation of polynomials.
Generator functions are a very interesting object in mathematics (see Wikipedia or Wolfram's MathW...
Main task
Your task is to print out integers in descending order, starting from 1, and increasing as you keep hitting 1 again, up until the given input is reached, then, print out the rest until you hit 1 again. Example with input 6:
1
21
321
4321
54321
654321
Without newlines (valid output):
12...
Indexes of indexes reversed code-golf
Sorry for the confusing name. I didn't invent this challenge, but I find it very interesting to solve. (I hope this isn't a duplicate.)
For every input number, e.g.:
4
Generate a range from 1 to that number:
[1 2 3 4]
And then, for every item in that ...
This community last had an election last year, and has recently seen their moderator team reduced by two.
As such, by request of the remaining two moderators on the team, and to find replacements for Mego and Dennis, we're looking at scheduling an election to start somewhere in January 2020. To...
We have to find the Largest subsequence with the given pattern.
X1X2X3X4XnXnX4X3X2X1
No adjacent characters should be same except Xn.
example:
string is : acdbdea
Then the output is adda.
Can somebody please help me in this.
How to solve it.
The challenge is to show your game written in Mother of all programming language ie C.
Criteria:
A reasonable scoring system must be in place, which rewards multi-line clears more than single-line clears. The current score must be visible at all times.
The next piece that will appear must be indi...
