0
0
Suppose you are given an array A of n distinct positive integers. Write an algorithm that will output one element x of A such that x is among the top 75% elements of A. Note that the top 75% elements of A are the last 75% elements when A is sorted. Your algorithm should not take more than 0:25n c...
Here is continuation of this question, this time lets compress/generate Mario in colors!
Image size is 64x64 (above one is zoomed). The required output is valid <img ...> tag with exact same image in dataURI form, working on chrome, firefox and safari (and IE4 - joke ;). In snippet below you ...
Golf Golf!
This is my first challenge, so please be gentle! The challenge is to write a program that will output the correct score for a layout in the card game "Golf."
The card game Golf has many variations. The house rules I use follow the standard rules for Six-Card Golf given by Pagat, with...1
Injection from two strings to one string code-golf string
Challenge
Write a program that applies an injective function which takes two strings as input and one string as output. In other words, each input must map to a unique output.
Specifics
The input may be any two strings of arbitrary le...
I came across this little web game Drench
Its a fairly mindless game , I wrote a small JS snippet to play this game for me in the background of my browser, it cycles through and clicks on the 6 possible moves
let ind =0;
let games =0;
let wins =0;
let lastMoves = "";
setInterval(function(){
if...
The problem has 3 inputs.
L: a list of all numbers
size: the size each set can be
max: the max sum amongst each set
The challenge is as follows:
Given L, size and max, construct as many sets from L such that the number of elements is size and the sum of each of the elements does not exceed m...0
No, you don't need deep learning: AlpaGo edition
To counter the industry fad of tackling the most trivial problems with deep learning, I propose that a proof of concept be created to demonstrate that simple database queries are in fact often sufficient. To wit, I propose to demonstrate that a da...
You are given a square \$n \times n\$ matrix \$A\$, and a list (or vector) \$u\$ of length \$n\$ containing the numbers \$1\$ through \$n\$ (or \$0\$ through \$n-1\$). Your task is to reorder the columns and rows of the matrix \$A\$ according to the order specified in \$u\$.
That is, you will c...
