Oleg Tarakanov
Results
1
issues of
Oleg Tarakanov
As n = n + 300 (mod 15), this algorithm takes three buffers of 100 numbers each, writes them into output, and increases numbers (that aren't divisible by 3 and...