LITHUANIAN OLYMPIADS INFORMATICS

More documents

Recommendations

Info

$LTPlius stiliaus testas su LATEX klase âarticleâ$

34ExampleInputOutput5 50 2 4 0 0 1 2 4 4 00 1 0 0 0 0.5 1 2 2 00.25 0 1 0 0 0.25 0.5 1 1 00 0 1 1 0 0.25 0.5 1 1 00 0 0 0 1 0 0 0 0 1215. Fortune-teller. One fortune-teller can predict the future and foretell the probabilitythat one person (call him/her A 1) will meet another person (call him/her A 2).The probability is expressed in percents (natural number from 1 to 100).The fortunes are told in the following way: person A 1who applies to fortuneteller,tells his/her given and family names as well as the given and family names ofA 2. For example, Jonas Jonaitis and Janina Petrienė. Fortune-teller writes all data(given name and family name of A 1and A 2) into one row without space characters(it is assumed that capital letter and lower-case letters are the same), for example:JONASJONAITISJANINAPETRIENĖThis will make the first group of letters.The second group of letters will consist of several rows of letters.Fortune-teller shapes this group like this: takes letters of the first group in turn and• if the first row of the second group does not contain the letter, then she addsit to the end of the first row;• if the first row of the second group contains the letter, then she writes it underthe same letter in the column.Then under the second obtained group of letters fortune-teller writes how manytimes letters repeat in each column. Long line of digits is obtained – call it number sk1.For the first group of letters presented in example above the second group andnumber sk1 will be:JONASITPERĖJONASIT EJ NA INA IN32542421211 This is number sk1Further fortune-teller forms number sk2 in the following way: adds the first digitof sk1 to the last one and equates the obtained sum with the number sk2. Then sheadds the second digit of sk1 to last but one and writes the obtained sum to the end ofnumber sk2, then she adds the third digit from the beginning to the third digit from theend and writes the obtained sum to the end of sk2. Fortune-teller performs these
actions until there are no more digits of number sk1 left or until one middle digitremains, – in this case she just adds it to the end of sk2.Number sk3 is obtained from number sk2 in the same way and etc., until theobtained number becomes smaller or equal to one hundred. For example:32542421211437544 { 4=3+1, 3=2+1, 7=5+2, 5=4+1, 4=2+2, 4=4 }8712 { 8=4+4, 7=3+4 , 12=7+5 }108 { 10=8+2, 8=7+1 }90 { 9=1+8, 0=0 }Number 90 will be the result. It means that the probability that A 1will meet A 2is90 percent.Task. Write a program to calculate the probability for two persons to meet if theirgiven and family names are known.Input. The first row of input file contains the given name and the family name ofA 1, while the given and family names of A 2on the other line. A single space characterseparates given and family names. The length of a given and family name togetherdoes not exceed 25 symbols.Output. The probability of meeting A 1with A 2– one integer number – should beprinted to the screen.STAGE III, PART I35SENIOR DIVISION216. Game With a Maze. (Run time limit – to 20 sec.; processor Pentium 133MHz). The game consists of quadratic plate with a maze seamed in it. There is a ballinside the maze. The plate is covered with glass and so the ball cannot fall out of theplate. The plate is fixed to the vertical wall so that it is possible to rotate it by 90° tothe left (anticlockwise) or to the right (clockwise). During the rotation, the ball doesnot move (it is fixed). After the rotation is finished, the ball is released and it fallsdown until it strikes an obstruction (wall of the maze) ant its position is fixed again.Task. Given a maze of size n, the initial coordinates of the ball (x, y) and the sequenceof rotations, indicated with letters K or D. Squares of the maze are numerated from thebottom left corner beginning with 1 (x indicates rows, y – columns). Write a program todetermine where the ball would land up after performing the sequence of rotations.Input. The first line of the input file contains the size of the maze n (1 ≤ n ≤ 1000) andthe position of the ball – two numbers – x and y (1 ≤ x, y ≤ n). The second line containscommands – sequence of letters K and D. There are no spaces between these letters (thereis at least one command, the total number of commands does not exceed 5000).In the remaining n lines there is presented the maze itself: 0 indicates a passageand 1 indicates a wall.Output. Two numbers (coordinates of the ball) – must be written to the output file.
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 and 24: station) ts (1 ≤ ts ≤ 150). In
Page 25 and 26: We will analyze the following compu
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: wards). There are no spaces between
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?