Author:

• Name: Lennart Augustsson
  Location: SE - Kingdom of Sweden (Sweden)

To build:

    make all

To use:

    ./august

Try:

    ./try.sh

If you have the primes(6) tool (sometimes part of BSD Games) you can see what of the output in the first N (say 15 or 25) lines are primes:

    ./primes.sh # 15
    ./primes.sh 25

Note that try.sh will run this script anyway, telling you where to get primes(6) if you don’t have it installed, but it will only run with the default value of 15, rather than trying several different values.

Judges’ remarks:

An interesting use of a recursive call to main(). Compile and execute without args. What is the initial value of b? Does it alter the action of the program?

If you let it, the program will continue to print a numerical sequence (can you guess in what base it is printed by looking at the code?) until you run out of memory or until they sell your computer, whichever comes first.

If you use the primes.sh script can you figure out if there’s anything funny going on with the output?

Author’s remarks:

No remarks were provided by the author.

Primary files

• august.c - entry source code
• Makefile - entry Makefile
• august.orig.c - original source code
• primes.sh - script to try entry if you have the primes utility
• try.sh - script to try entry

Secondary files

• 1985_august.tar.bz2 - download entry tarball
• README.md - markdown source for this web page
• .entry.json - entry summary and manifest in JSON
• .gitignore - list of files that should not be committed under git
• .path - directory path from top level directory
• index.html - this web page

Jump to: top