Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Task
There are digits 0-9 where each digit also stands for an operation. The last digit is always combined with the previous operation. Print the result of this equation.
0 => +
1 => -
2 => *
3 => /
4 => bitwise compliment(~)
5 => invert
6 => increment by sum of all values(including 6)
7 => dec...
227. C++ (clang), 861 bytes, A004903 -- Currently being fixed
#include <iostream>
int pow10(int val) {
int b = val * val;
int c = b * b * val;
return c * c;
}
int main() {
int input;
std::cin >> input;
int values [8] = { 0, 0, 0, 0, 0, 0, 0, 0 };
for (int i = 0; i < input; i++) {
in...
-1
The "prime frog" is a strange animal that jumps between integers, until it arrives on 3 or 19...
Your program should accept an integer n as input and output the result of the below algorithm (3 or 19).
For a given integer n >= 2:
Let be f the position of the frog. It is initially set to n
i...
I am new to codegolf. I hope this challenge is appreciated here. I have no clue...
Challenge
You and your friend decide to play a game using a stack consisting of bricks.
In this game, you can alternatively remove 1, 2 or 3 bricks from the top, and the numbers etched on the removed bricks are ...
0
WPA2, the actual encryption standard that secures all modern wifi networks, has been cracked... This challenge has nothing to do with the way that the WPA2 was cracked, however is is about computing the 64-digit hexadecimal key that corresponds to a given WPA-PSK pass-phrase.
A wireless network ...
This is Hole-9 from The Autumn Tournament of APL CodeGolf. I am the original author of the problem there, and thus allowed to re-post it here.
Given a simple (rectangular, non-jagged) Boolean array (of one or more dimensions) return a list of thusly shaped arrays where the first array is ident...
