KöMaL - Középiskolai Matematikai és Fizikai Lapok
 English
Információ
A lap
Pontverseny
Cikkek
Hírek
Fórum

Rendelje meg a KöMaL-t!

KöMaL Füzetek 1: Tálalási javaslatok matematika felvételire

VersenyVizsga portál

Kísérletek.hu

Matematika oktatási portál

Problems in Information Technology, December 2005

Please read the rules of the competition.


Problems with sign 'I'

Deadline expired on 16 January 2006.

I. 118. We have n ceramic piggy banks and n keys, each corresponding to exactly one of the banks. We throw one key into each bank at random. Then we break open t ceramic pigs. Find the probability that we are able to open the remaining banks using the keys found in the broken ones without any further breaking. Write a program that estimates this probability by making k experiments. If n<10, then we should also compute the exact probability by examining all possible cases.

Your program should read the values of n, t and k from the keyboard, then make the experiments and display the resulting relative frequencies (that is, the ratio of successful outcomes to k), further, the exact probability.

The source code of the program should be submitted (i118.pas, i118.cpp, ...).

(10 points)

Statistics

I. 119. Using the programs Comenius Logo, PC Logo or NetLogo, make an animation showing the classic chess game of Botvinnik and Capablanca at AVRO Championship Rotterdam, 1938.

The size of the board should be 560×560, and each figure should be displayed as the trace of a corresponding turtle.

The final logo project (i119.lgp) should be submitted, containing a procedure chess running the animation.

(10 points)

Solution (in Hungarian)

I. 120. We take a loan of S Euro at p per cent compound interest for n months. We pay back the loan in equal monthly installments: the first installment is paid back at the end of the first month, and the n^\mathrm{th} installment is at the end of the n^\mathrm{th} month. Before paying back an installment, the bank capitalizes the loan, that is, first our debt is increased according to the rate of interest, only then is the currently paid back sum subtracted from the debt, which is finally rounded up to a nonnegative integer.

Prepare an OpenOffice or Excel sheet summarizing our debt in the course of time. The user enters the initial sum S of the loan, the compound interest rate p and the loan duration n into cells A2, B2 and C2, respectively. Cell E2 should contain the monthly installment, while column B should contain the current debt after paying an installment. Change of the debt should also be graphed in cells C4...F15. In its first row and column some remark should be visible explaining the meaning of the graph.

Example:

You should submit the sheet (i120.sxc, i120.xls, ...). The value of n can be assumed to lie between 3 and 24. Cases when the interest rate p is 0 should also be handled correctly.

(10 points)

Solution (in Hungarian)


Problems with sign 'S'

Deadline expired on 16 January 2006.

S. 13. Two players alternately move a piece on the vertices of a directed graph. One loses if he or she cannot move because the current vertex has no outward edge. If the piece is placed for the third time onto the same vertex, the game is a draw. Write a program that determines for each vertex the best possible result of the first player starting from that position.

The program will be run from the command line with two parameters containing the names of the input and output files. The input file contains the graph. The output file should contain whether any given vertex is a winning or a losing one.

The first line of the input file will contain the number of vertices and edges (n,m). The vertices are numbered from 1 to n. The next m lines will contain the origin and endpoint of each directed edge. The output file should have n lines, with the i^\mathrm{th} line containing W, D or L, depending on whether the first player starting from the i^\mathrm{th} vertex has a winning strategy, both players have a strategy to force a draw, or the second player has a winning strategy, respectively.

The graph can be assumed to have at most 1 000 000 vertices and at most 50 000 000 edges.

Example: the program is run with s13 graph.txt result.txt parameters.

graf.txtresult.txt
5 7
1 1
1 2
2 3
2 4
3 1
4 3
4 5
D
D
D
W
L

The source code of the program (s13.pas, s13.cpp, ...) should be submitted.

(10 points)

Statistics


Send your solutions by e-mail to:

solutions.informatics@komal.hu

Támogatóink:   Ericsson   Cognex   Emberi Erőforrás Támogatáskezelő   Emberi Erőforrások Minisztériuma   Nemzeti Tehetség Program    
MTA Energiatudományi Kutatóközpont   MTA Wigner Fizikai Kutatóközpont     Nemzeti
Kulturális Alap   ELTE   Morgan Stanley