@Christopher I mean, instead of defining four different criteria for optimisation and making people encode them in their programs, you could pass the weights (or areas, densities, etc) of each type of coin as input.
@Christopher That would make it less of a Kolmogorov-complexity type challenge and more of a dynamic programming challenge, which is more interesting, IMO.
There was problem asking to write n programs a0, a1, a2, ..., an-1, so that running ak outputs a(k+1) mod n, and the score is sum(len(ai))/n2. Lower score the better.
Lots of answers just have a format and with the format score can go as near as you want zero. Do they have order in this case?
@ngn Ah yes, it's the knapsack problem with an infinite supply of coins (or at least the cent amount of each coin). I don't think anyone has posted the proper knapsack problem yet.
@Christopher How about word it something like this: Knapsack variant: Given a number of cents/whatever n and a set of coins/whatever with a value and a weight (v,w), give the partition from n into coins with a combined value of n that minimizes sum(w)
Knapsack Problem
Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
Wikipedia for more information
For example you can be...
Roguelike pathfinding
Sandbox post
Your task will be, given a two-dimensional array of the elements described below, which represents a dungeon, to output or return a single number representing the amount of gold pieces the rogue can collect without waking up any monsters.
The elements of the ...
See all the blocks
In a 3D coordinates, a block (a,b,c) takes the place of x<a<x+1, b<y<b+1, c<z<c+1.
Is there a point that can see every block? (Exist point P, For each block K exist point Q, segment PQ don't go across any block but K)
Is there a way that can see every block? (Exist non-zero...
to print all lines as well, since $NR is from what I understand the value of the record NR, just like $NF is the value of the column NF, and that value should be converted to true or false
NF and $NF are different things, just like NR and $NR are different. @ngn I know how to print line numbers, my question about $NR is only for understanding purposes
I got it!
$NR for the 2nd row is $2, since NR is 2 on the second row, but there is no field $2 so it's given value "", which equates to false which means the row is not implicitly printed
with this in mind seq 0 4|awk '$NF' prints only the numbers 1 to 4, since $NF is always $1, as number of fields in each line is one, but on the first input line $1 is 0 (the first field), which is evaluated to false, hence not printed
to print all seq 0 4|awk '//'. Thanks everyone! Just discussing it helped me understand it faster.
Heroes of Might and Magic 0: A Numerical Boxing Match
It's time to program a game!
Well not a game, precisely. More of a stripped-down version of a game, without graphics or real-time input... or really much of anything. But it'll modify numbers on screen, and isn't that why we play games in t...
word online has the worst scrolling i've ever seen >:(
rather than the logical "a little bit of movement on the scroll input means a little bit of scroll", for some reason it starts jumping and skipping multiple lines of scroll for no reason
there is no way that someone appreciates this behaviour
There was problem asking to write n programs a0, a1, a2, ..., an-1, so that running ak outputs a(k+1) mod n, and the score is sum(len(ai))/n2. Lower score the better.
Lots of answers just have a format and with the format score can go as near as you want zero. Do they have order in this case?
Knapsack Problem
Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
Wikipedia for more information
For example you can be...
Roguelike pathfinding
Sandbox post
Your task will be, given a two-dimensional array of the elements described below, which represents a dungeon, to output or return a single number representing the amount of gold pieces the rogue can collect without waking up any monsters.
The elements of the ...
Heroes of Might and Magic 0: A Numerical Boxing Match
It's time to program a game!
Well not a game, precisely. More of a stripped-down version of a game, without graphics or real-time input... or really much of anything. But it'll modify numbers on screen, and isn't that why we play games in t...
