Arm/random

A linear congruential generator is a simple method often used to generate pseudorandom number sequences. The sequence starts with an arbitrary number (called a "seed"). Then to generate the next number in the sequence, multiply by a constant ("multiplier"), then add another constant ("increment").

In this problem, we will use a seed of 0, a multiplier of 134775813, and an increment of 1. Thus, the first few numbers in the sequence are:

0^th: 0 (This is the seed. We'll call it the 0^th number)
1^st: 1 (0 × 134775813 + 1)
2^nd: 134775814 (1 × 134775813 + 1)

When the number overflows, keep the lowest 32 bits (i.e., mod 2³²). This happens automatically without extra code.

Write a function that returns the n^th number in the above sequence.

unsigned random (unsigned n);

Expected solution length: Around 10 lines.

Sample Input

r0=2

Sample Output

r0=134775814

.global _start
_start:
    ldr r0, =2    // First function parameter is always passed through r0.
    bl random
    1: b 1b    // Done

random:

Write your solution here

Upload a source file...

arm/random

arm/loadexecPrevious

Nextarm/hailstone

Arm/random

From ASMBits

Sample Input

Sample Output

Write your solution here

Or upload a file

Solution