THE INTERNATIONAL SOLOMON UNIVERSITY
- quality education for reasonable money
15 June 2007
Our partners
KIEV CITY COMPETITION OF SCHOOLBOYS IN INFORMATICS
Organizators:
the Institute of Cybernetics,
the International Solomon University,
the Information Centre “Elvisti”,
the Computer Centre “Mali”.
The International Solomon
University in Kyiv
is organized for the students of 9-11 grades.
Head of the Olympiada jury - General director of Cibernatics Center of the Ukrainsan Academy of Sciences, academician I.V.Sergienko.
Program
1st tour March 11, 2006, 10.00
2nd tour March 18, 2006, 10.00
Winners' rewarding will be on April 14, 2006, at 15.00.
Place:
International Solomon University, Kiev, Sholudenko, 1b
The winners will receive grants for free studying in the ISU, valuable presents from organizers.
TERMS
1. Participants will receive a set of tasks of defferent complexity levels. Tasks - about algorythmization and programming. On the first stage there are 5 tasks, on the second - 3 tasks. To solve - as much as everybody can.
2. Task: to write algorythm (in any form) and a program.
3. The task is fulfilled if it is programmed in the computer, saved on the server and is working according to the task terms.
4. For each task fulfilled there is an amount of poins, which is corresponding to the complexity level shown in the task.
5. Duration of tasks fulfillment - 3 hours.
6. The participants will be provided with computers with MS Office (Word, Excell, Access, VBA), Borland Pascal 7.0, TurboC++ 1.0, Borland C++ Builder 5.0, Borland Delphi 5.0. Operation system - Windows 98. You can choose any of the programs proposed.
7. Participants can not carry at Olimpyada celular phones and any other devices that can make sounds or communication.
8. Participants can use one any book, calculator, pen, pencil, ruler.
Applications are accepted both from schools and from private persons until 5.03.2006 by phone 236-20-74 from 9.30 till 17.30, except Saturday and Sunday, and via e-mail: olimpiada@meta.ua
Compulsary to point:
1. Name, last name
2. age
3. school
4. grade
5. contact information
6. what tasks you can solve
7. which languages of programming you use
HOW IT WILL BE CONDUCTED
1st stage – 11.03.2006
Tasks in algorythmization and programming (1-3 levels of complexity).
10.00 – 13.00 - first stream
13.00 – 16.00 - second stream
16.00 – 19.00 - third stream
Before the beginning there will be consultations for each stream up to 30 minutes.
25 the best will participate in the 2nd stage.
2nd stage – 18.03.2006 10.00 – 14.00
Tasks in algorythmization and programming (4-5 levels of complexity).
All participants of the second stage will be awarded the diplomas.
The winners of the second stage will receive a grant for free studying in the ISU, valuable prizes and presents.
Rewarding - 14.04.2006 at 15.00
MAIN
NEWS
MISSION
HISTORY
ACCREDITATION
SPECIALITIES
FACULTIES
FORMS OF STUDY
SECOND SPECIALITY
PRICES
DIPLOMAS
PARTICULAR PROGRAMS
FOR SCHOOLBOYS
FOR JOINERS
RULES OF ENROLL
RULES OF STUDIES
FOR STUDENTS
FOR TEACHERS
FOR GRADUATES
CONTACTS
1. The integer m is given. To insert between some figures 1, 2, 3, 4, 5, 6, 7, 8, 9, written down in this very order, characters +, - so that the value of the resulted expression is number m. For instance, if m=122, the following parity will be right: 12+34-5-6+78+9. If the required placing of characters is impossible, point it out.
2. The corridor sized 2 x n (n<101) has to be covered by covering constituting blocks sized 1 x 2. In how many ways this can be done if it is necessary to use the least quantity of blocks and there must be no uncovered surface? For instance, corridor 2 x 3 can be covered in three ways, and the one 2 x 4 - in five ways.
3. The community of robots lives according to the following laws:
- one time in the beginning of the year they unite into groups of three or five robots;
- during one year the group of 3 robots gathers 5 new ones, and the group of 5 robots gathers 9 new ones;
- the robots unite so that to gather in one year the largest quantity of new robots;
- each robot lives three years after gathering.
It is known that the prior quantity of robots equals k and they all are just gathered. How many robots there will be in n years?
4. Four words are given. To write a program checking if it is possible to make a crossword out of these words under condition that each word is crossed with two others and is situated top-down or from left to right. The net doesn't have to be symmetrical. Point the result as a crossword.
USEFUL REFERENCES
