GETTING INPUT

Computing competitions do tend to have an unexpected challenge for students. Dealing with the inputted data, the amount of data and how to organize it is often a big issue. And it takes up valuable competition time to figure this out.

Let’s look at a few scenarios.

SCENARIO 1A – GETTING n DATA ON n SEPARATE LINES (n is known before run-time)

SCENARIO 1B – GETTING n DATA ON n SEPARATE LINE (n is determined at run-time)

SCENARIO 2A – GETTING n DATA SPACE DELIMITED ON A SINGLE LINE (n is known before run-time)

SCENARIO 2B – GETTING n DATA SPACE DELIMITED ON A SINGLE LINE (n is determined at run-time)

SCENARIO 3A – GETTING n DATA PER LINE OVER m LINES (n & m are known before run-time)

SCENARIO 3B – GETTING n DATA PER LINE OVER m LINES (n & m are determined at run-time)

FOR COMMA DELIMITED DATA ON ONE LINE (see last example from 2A)