LITHUANIAN OLYMPIADS INFORMATICS

More documents

Recommendations

Info

$LTPlius stiliaus testas su LATEX klase âarticleâ$

12Output. The first row of the output file should contain k, the length of the longestlist of days. In the remaining k lines there must be written the numbers of days (inascending order) the list contains.ExampleInput Output Comments651051281341356List of days and ratings during these days are presented below:1 day 3 day 5 day 6 day5 5 8 13STAGE III, PART IIJUNIOR DIVISION189. Magic Square. Magic Square is a square table of natural numbers when thesums of each column, row and of both diagonals are equal.The n×n square table of natural numbers is given. Supposedly it is or could be amagic square, if we change one number only.Task. Write program to find if the given square is magic and if not, find out if it ispossible to get a Magic Square from it by changing one number only.Input. The first line of the input file contains a natural number n (2 ≤ n ≤ 50).Each of the following n lines contains n natural numbers (square table).The input data are given correctly: the sum of any row, line or diagonal will notexceed maxlongint.Output must be written in the file.If the given table is Magic Square, output must be MAGIC SQUARE.If it is possible to obtain the Magic Square by changing one number, the first lineof the output file should contain: POSSIBLE. The second line should contain thecoordinates of the replaced number(the number of line followed by thenumber of column) and the numberwe change to.If it is not possible to obtain theMagic Square output should be: NOTPOSSIBLE.Input312 17 1612 15 1114 13 18ExampleResultPOSSIBLE2 1 19190. Conspirators. The personae – conspirators – of one Jules Verne story wishingnobody could read messages they were sending to each other used the following method.
The message was hidden in the squaretable with contained different symbols(mostly letters). Square grid of the samesize with little holes in certain places wasused for decryption. For example, see picture190.1.The grid was put on the table and certainletters could be seen through the holes.The beginning of the encrypted messagewas obtained by reading those unhiddenletters from left to right and from the upperpart downwards. Then the grid wasturned by 180 degrees and the other letterscould be seen. After reading those lettersin the mentioned order, the end ofmessage was obtained. The whole messagewas decrypted like picture 190.2.The hidden message is there: GINKLAI YRA!After the message had been written to certain cells (according to the chosen grid),freely chosen letters and symbols were written into empty cells of the table and theencryption process was over.Task. Write a program to find the grid that should be used for encryption usinggiven the square table with symbols and the message. The input data are such that thesolution always exists. If several solutions are possible find any one of them.Input. The first line of the input file contains the message (not encrypted). Thelength of the message is from 2 to 100 symbols and it is necessarily divisible by 2.The second line contains the size N (1 ≤ N ≤ 50) of the grid (and of the letter table)used for encoding. The remaining N lines contain the letter table. Each line containsN symbols; there are no spaces between them.Only capital letters, punctuationmarks and space characters can be usedin the table and in the message. Neithermessage, nor any line of the table endswith space character.Output. The found grid should bewritten to the output file containing Nlines and each line containing N symbols.Holes should be marked with capitalO, and the remaining cells should bemarked with the capital X.G U D A S A SE M I E !N Y I A G O NA A A R B D KR N A A A K IŠ L V A ! M V! U S S O !GLPicture 190.1I N YAInputGINKLAI YRA!7GUDASASE MIE !NYIAGONAAARBDKRNAAAKIŠLVA!MV!USSO !K R APicture 190.2ExampleIResultOXXXXXXXXXXXXXXXOXXXOXXXXXXXXXXXXOXXOXOXXXXXXXXXX13!
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: to crossing c, then number of cross
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 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

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

Delete template?

Save as template?