Background
You have again been given the task of calculating the number of landmines in a field. However, we have now travelled into the flatlands.
You must calculate the landmine score given a list/string of numbers (which will be 2D) and the landmine number.
The landmine number tells you where ...
I want to move the entire data segment 2 bytes to the right while optimizing for size in nasm,
My best Idea is:
std
pusha
push es
push ds
pop es
mov si, bp
lea cx, [bp+0x1]
lea di, [bp+0x2]
rep movsb
pop es
popa
But it takes 17 bytes...
Problem Statement
John, the magician is putting some magic colors in a box serially. But he is not providing any divider between the colors. So, the color may be mix up instantly.
There are three types of colors- Red, Green and Blue. How they could mix up is given below -
Red+Blue = Purple
Red+Gr...
Given a number $n \geq 3$ as input output the smallest number $k$ of modular residues of $k$ by the first $n$ primes is exactly $\{-1,0,1\}$. That is there is a prime in the first $n$ pr...
i don't think there is one the idea has been floated but it would either be a huge pain to fully implement or rely on internet access (and be limited in how far it can compute sequences that aren't exhaustively listed)
@UnrelatedString A third option that's still difficult and limited, but less so of either, is scraping the programs listed to generate the sequence, predicting their I/O format, and using installed copies of Mathematica, Sage, Python, etc. to run them
I want to move the entire data segment 2 bytes to the right while optimizing for size in nasm,
My best Idea is:
std
pusha
push es
push ds
pop es
mov si, bp
lea cx, [bp+0x1]
lea di, [bp+0x2]
rep movsb
pop es
popa
But it takes 17 bytes...
