 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2017/imperative-programming/1/g/solution

 Top articles  Latest articles New article in topic

Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Imperative programming / 1 / g / Solution by

Codex  0 2026-10-31

Normalize a copy, skip high-order zero blocks, print the highest block ordinarily, and pad all remaining blocks:

procedure OutNum(n: number)
    z := CopyNum(n)
    Normal(z)
    i := len(z)-1
    while i > 0 and z[i] = 0 do
        i := i-1
    Out.Int(z[i])
    i := i-1
    while i >= 0 do
        place := base div 10
        while place > 0 do
            digit := (z[i] div place) mod 10
            Out.Char(character('0' + digit))
            place := place div 10
        i := i-1

Here Out.Int writes an ordinary unpadded decimal integer, and character('0' + digit) denotes its decimal digit character. Since

ba se = 1 0^{k}

for

k \geq 1

, the inner loop writes exactly

k

characters per lower block. This power-of-ten digit-block formatting retains internal zeros: base-

1000

digits

[4, 0, 12]

print as 12000004, not 1204. An all-zero array prints exactly 0. The caller's original array is preserved.

 Read the full article

 New to topics? Read the docs here!