20104번 - Timecard 서브태스크다국어언어 제한함수 구현

문제

In IOI 2018, we will record names of person who enters the arena. The record will consist of uppercase letters of the Latin alphabet and/or lowercase ones. To make it easier to read, you will have to convert uppercase letters on the record to lowercase.

구현

You should implement the following procedure and function:

init(int N)

• This procedure is called only once, before any calls to convert.
• N: the number of names in the record.

string convert(string s)

• This function is called N times after init is called.
• s: the name in the record.
• This function should convert uppercase letters in the string s to lowercase, and return the result t.

예제

init(3)

There are 3 names on the record in this example. Then the grader makes the following procedure calls:

The files sample-01-in.txt and sample-01-out.txt in the zipped attachment package correspond to this example. Other sample inputs/outputs are also available in the package.

입력

출력

제한

• 1 ≤ N ≤ 100
• 1 ≤ |s| ≤ 20 (Here |s| is the length of the string s.)

서브태스크

힌트

샘플 그레이더

The sample grader reads the input in the following format:

• line 1: N
• line 1 + i (1 ≤ i ≤ N): s_i

The sample grader first calls init(N), and then convert(s) for s = s_i (i = 1, 2, ..., N). It prints the return values of convert in the following format (Now, t_i is the return value of convert(s) for s = s_i):

• line i (1 ≤ i ≤ N): t_i

첨부

• cpp: grader.cpp timecard.cpp timecard.h
• in: sample-01.txt sample-02.txt
• out: sample-01.txt sample-02.txt