More information

You can keep reference books with yourself during the competition. For example, you can refer to the book for the syntax of filing. Algorithm books will not be allowed.

The only requirement to get a problem right is that you solve the problem correctly. Code clarity, neatness, variable naming have no points at all!

The clock won't stop ticking! You'll get a penalty for every minute that passes, the idea is to get as less penalty as possible; which is, of course, just a fancy way of saying that you need to work out the problems as quickly as possible!

The team that solves the most questions will be the winner, penalty does not count if the number of questions solved is higher

You do not need to remember algorithms for the competition, the only thing you need to practice is your skills on the keyboard, I guess :)

Come with a fresh brain on May 9th. A fresh and rested brain makes all the difference!

We recommend that you study ArrayList in C# and if you're doing it in C++, make sure you have command over vector<> container to build up dynamic arrays.

If the problem involves dynamic arrays, you're adviced to use a standard library instead of making elementary linked lists yourself

It won't be tough as it sounds!

Best of luck!

Faisal

Sample Problem - 1

[Taken from the internet]

Sample Problem #1

Description:

You are given a limited number of coins of various denominations, and a certain amount. You are to compute how many ways there are to pick the coins to add up to that amount. For example, given 12 coins of 1-cent value, 2 coins of 5-cent value and 3 coins of 10-cent value, and an amount of 15 cents, there are 4 combinations:

• 2 5-cents coins and 5 1-cent coins
  
• 1 5-cents coins and 10 1-cent coins
  
• 1 10-cent coins and 1 5-cent coin
  
• 1 10-cent coins and 5 1-cents coins

The answer therefore should be 4.

Input:

The first line of the input file consists of a single positive integer indicating the number of different coin denominations. The next line of the input file consists of a single positive integer representing the total amount. The remaining lines of the input file each consist of a pair of positive integer representing a coin denomination followed by the number of coins of that denomination available. All numbers are in the range of [1, 100].

The sample input and output are shown below.

Sample input:

3 15 1 12 5 2 10 3

Sample output:

4

Programming Language options

Following is a tentative list of languages you can use to code the problems in:

C/C++ (Turbo C++/Borland C++)

Visual C++

C#

Java

Any questions or suggestions can be sent to cisinfinity@gmail.com

Programming Tips

You will need to focus on following programming areas for the competition:

Good problem solving skills. An intuition for programming.

Good grasp on recursion.

Well versed in basic number theory. The things most of the people know at this stage are suffcient

Arrays. And their novel uses.

String Manipulation.

Filing. Ability to read multiple data sets from a text file and to
separate data items on a single line. This is very necessary as
problem inputs must be read from files.

NOTE: The last point is extremely important as all questions would require you to read input from the file. It will become more apparent when we post a sample question.

CIS Infinity Speed Programming 2005

CIS Infinity is the CIS Speed Programming competition happening for the first time in the history of CIS department of NED University, organized by Batch 2002-2003 students. The event is scheduled to happen on May 9, 2005 in the CIS department with a total 16 teams participating from each batch. Details of competition will be posted on this blog very soon. Please stop-by to see sample questions and tips for the competition! See you on May 9th.

Date: May 9, 2005
Venue: CIS Department, NED

Faisal