LITHUANIAN OLYMPIADS INFORMATICS

More documents

Recommendations

Info

$LTPlius stiliaus testas su LATEX klase âarticleâ$

8Task: Draw Koch’s QuadricIsland of the third degreeon the paper. Write an algorithmto draw Koch’s QuadricIsland of the n’th degree.Input is the degree of thecurve: an integer number n,1≤ n ≤ 8.Picture 184.2Picture 184.3If you do not have enough experience working with graphicsCopy the file EGVGA.BGI to your working folder. Your programmight look this way:program Koch;uses graph; { module graph will be used }procedure draw (n: integer);begin... { the code of the procedure }end; { draw }In order to draw the curve the followingfunctions and procedures of graph module mightbe useful.function GetMaxX: integer;{ returns the maximum available x coordinate }function GetMaxY: integer;{ returns the maximum available y coordinate }var n, { the degree of the curve }driver, { graphic driver }mode: integer; { graphic mode }beginreadln (n); { inputs the degree of the curve }{ automatic graphic driver detection }driver := detect;{ graphic mode initialization }InitGraph (driver, mode,'');draw (n); { call to curve drawing procedure }readln;CloseGraph; { back to the text mode }end.procedure line(x1, y1,x2, y2: integer);{ draws line from (x 1, y 1) to (x 2, y 2) }STAGE IIIJUNIOR DIVISION185. House Painting. The modern many-storeyed house is being built. It willhave n floors. The floors are counted starting from the first floor. Each floor will bepainted with one of the two colors: white or gray. Two consecutive floors can bewhite, but can’t be grayTask. Write a program to find the number many ways the n floor house can bepainted.ExampleInput data is number of floors of the house n (1 ≤ n ≤ 21)Input Outputgiven from the keyboard.Output (one integer number) should be printed to the screen. 3 5
9186. Amusement Park. Two carousels(roundabouts) A and B are spinningcontrariwise (see picture 186.1).They have a and b trucks respectively.It is not possible to move from onetruck to another in the same carousel.But carousels are set so close to eachother that one can easily jump from onecarousel into another in the placewhere they adjoin.Picture 185.1At each moment of time one and only one truck of carousel A adjoins with one andonly one truck carousel B. Carousels spin at such speeds that after one moment of timetrucks, neighboring to the trucks that were adjoined at the previous moment, adjoin.At the picture below two black trucks adjoin. After one moment of time two graytrucks will adjoin. For example, someone entered carousel A. He can jump to a truckof carousel B and after carousel B turns around, He can come back to some truck ofthe carousel A.Task. 1) Given the numbers of trucks in both carousels a and b (20 ≤ a, b ≤ maxlongint).At the initial moment the naughty teenager is in the truck of carousel A. The task isto find the number of different trucks of carousel A that the teenager can visit withthe help of carousel B.2) It is known the number of trucks a of the carousel A. The task is to find theminimal number of trucks of carousel B such that the teenager from any truck ofcarousel A could get into any other truck of carousel A with the help of carousel B.Write a single program that could find both numbers (i.e. would solve the firstand the second parts of task).Input. The first line of the input file containsthe number of trucks a of carousel A andthe number of trucks b of carousel B.Number a is the input data to the both partsof the task, and number b is the input data tothe first part only.Picture 186.1InputExampleOutput24 22 1223
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: STAGE II7SENIOR DIVISION182. Code o
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 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
show all

LITHUANIAN OLYMPIADS INFORMATICS

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

Delete template?

Save as template?