LITHUANIAN OLYMPIADS INFORMATICS

More documents

Recommendations

Info

$LTPlius stiliaus testas su LATEX klase âarticleâ$

24number of lines, how many times theExamplephrase was found in the text. Each lineInputOutputshould contain two integers indicating the1 11 3place where the found phrase starts. Theselittleshould be the number of the line in theA little rabbit.text and the position in that line.Numbers of lines in the output file must be presented in ascending order.200. Checkers. On the black cells of square checkerboard there are placed several black and white pieces andone gray piece. White and black pieces do not make anymoves, and the gray one captures black pieces accordingto common rules: gray checker captures a black piece byjumping over it, diagonally, to the adjacent vacant squarebeyond it. The three squares must be lined up (diagonallyadjacent). But there is one restriction: the gray piececan capture black one only forward, i.e. number of lineof the gray piece can only increase.Task. Write a program to calculate the maximum numberof black pieces that can be captured by the gray piece in one move. One moveconsists of one or more jumps.Input. The first line of the input file contains the size of the board n (3 ≤ n ≤ 60).The second line contains the total number of pieces on the board M.Further there are such M lines. Each line indicates thecolor and the position of one piece in the following way:S x yS can be one of the three symbols: J means black, B– white, P – gray piece; x is the number of column, y –the number of row.Columns are numbered starting with one from rightto left and upwards. Cell (1, 1) is white. There is oneand only one line in the input data beginning with letterP (there is only one gray piece).Output. The maximum number of black pieces thatthe gray piece can capture with one move – should bewritten to the first line of the result file.Input98J 2 7J 3 6B 8 9J 5 6P 4 5J 5 2J 5 4J 7 8Picture 200.1ExampleOutput1201. Interpreter of Machine–language Codes. (Run time limit - 50 sec., processorPentium 133 MHz) Nowadays programmers practically do not have to dealwith machine–language codes. Essentially any program (for example, TURBO.EXE)is just a set of codes (binary digits) for a computer. Some numbers from this set meanprocessor instructions, the other ones – data for these instructions.
We will analyze the following computing machine model. Machine has N cellmemory. Cells are numbered from 0 to N–1. To any cell an integer from 0 to 2 k –1 canbe written. The machine has got one additional cell of memory; we will call it registerR. One integer from the interval 0..N–1 can be memorized in this register.Any program executed by this machine is written to memory starting with a certaincell (the number of this cell is called an address). The address of this certain cellis written to register R.The first The second The thirdfield of an field of an field of anExplanations of instructionsinstruction instruction instruction0 I J Content of the cell J is written to the cell having address I.1 I J Content of the cell L[J] is written to the cell havingaddress I. Content of the cell J remains the same.2 I J Operation L[I] + J is executed. Result of composition iswritten to the cell I (i.e. to the cell having address I).3 I J Operation L[I] + L[J] is executed. Result of compositionis written to the cell I.4 I J Operation L[I] –J is executed. The result of subtraction iswritten to the cell I.5 I J Operation L[I] – L[J] is executed . Result of subtractionis written to the cell I.6 I – Number is read from the keyboard, the cursor moves to anew line and the number that was read is written to thecell I.7 I – Number L[I] is printed to screen and the cursor moves toa new line.8 I J If L[I] > L[J], number 1 is written to the cell I, otherwisethere is written zero.9 I J If L[I] = L[J], number 1 is written to the cell I, otherwisethere is written 0.A I J If L[I] < L[J], number 1 is written to the cell I, otherwisethere is written 0.B I J If L[J] = 0, then it is moved to the cell I, and theinstruction that is in that cell is executed; otherwisefurther instructions are executed.C I J If L[J] ≠ 0, then it is moved to the cell I, and theinstruction that is in that cell is executed; otherwisefurther instructions are executed.D I – It is moved to the cell I, and the instruction in that cell isexecuted.E – – Halt; Program is finished (the processor stops after thiscommand).25
Page 1 and 2: Valentina DagienėJūratė Skūpien
Page 3 and 4: PrefaceLithuanian Informatics Olymp
Page 5 and 6: ) There are n (n ≥ 2) coins. Writ
Page 7 and 8: STAGE II7SENIOR DIVISION182. Code o
Page 9 and 10: 9186. Amusement Park. Two carousels
Page 11 and 12: to crossing c, then number of cross
Page 13 and 14: The message was hidden in the squar
Page 15 and 16: Below is sample of map of the Kingd
Page 17 and 18: One instruction can involve 1, 2 or
Page 19 and 20: Andrius has not quite decided how m
Page 21 and 22: Output. Output must be written to t
Page 23: station) ts (1 ≤ ts ≤ 150). In
Page 27 and 28: OLYMPIAD XII27STAGE IJUNIOR DIVISIO
Page 29 and 30: 29Rank of tomatoes originallyRank o
Page 31 and 32: Task. Given the first member of seq
Page 33 and 34: wards). There are no spaces between
Page 35 and 36: actions until there are no more dig
Page 37 and 38: written from the first position of
Page 39 and 40: Task. Write a program to find the l
Page 41 and 42: Input data are presented in the inp
Page 43 and 44: 43Input Output Explanation3 4 342 4
Page 45 and 46: small Latin letters, multiplication
Page 47 and 48: 230. Interest. A man went to borrow
Page 49 and 50: 8730 - 0378 == 8352; n 5;8532 - 235
Page 51 and 52: any comparator can be only theadjac
Page 53 and 54: of the boat and of the bicycle as w
Page 55 and 56: Output. N integers (numbers of jobs
Page 57 and 58: 1 2 3 4 5 6 7 8 9 10 11 12 13 141 g
Page 59 and 60: 248. Boxes. There are N boxes of va
Page 61 and 62: Output. The output file must contai

LITHUANIAN OLYMPIADS INFORMATICS

Create successful ePaper yourself

Delete template?

Save as template?