JCEASY - Jamcode 2006 (Easy)
There is one unnamed popular programming contest for people from all around the world. (Its name matches "SearchEngine Program Marmalade".) The contest starts with a coding phase where the contestants write code. After the coding phase there is a challenge phase. In this phase one can gain points when she finds a bug in someone else's code.
We were all lame and performed very badly. In fact, none of our programs worked. Thus we decided to hold a new contest: the Jam Code. Here, the task is to write a program that will never work correctly.
This contest will have an anti-challenge phase, where your goal is to find at least one test case such that a given program actually works ; in other words, it computes the correct answer.
Problem specification
You will be given a programming task and someone's source code. Find a valid input such that the program computes the correct answer.
Easy Task specification
The input file contains an integer M (0< M and M < 200) followed by M integers a[1], ..., a[m] in the range 1, 2, ..., 334. Output one line with the string sa[1]sa[2]...sa[m]. Here is the list of strings s1, ..., s334.
Example
Input 3 1 2 3 Output 020202020202020212021202121212021202121202021212
The file jceasy.cpp contains the program you are supposed to anti-challenge.
You are to submit a file which contains a valid input.
Added by: | Fudan University Problem Setters |
Date: | 2007-12-01 |
Time limit: | 0.100s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | TEXT |
Resource: | IPSC 2006 |