LITHUANIAN OLYMPIADS INFORMATICS

More documents

Recommendations

Info

$LTPlius stiliaus testas su LATEX klase âarticleâ$

30Task. Write a program to multiply two numbers in this way. It is known that theproduct will not exceed maxlongint.All different intermediate values and the calculated product of the given numbersmust be written. Input data corresponding the example above would be 325 6874,and the result would contain four numbers:6874 34370 474306 2234050.STAGE IIJUNIOR DIVISION208. Who Had Stolen the Wallet (theoretical problem). The wallet had disappearedin one office. All five persons who were in that room were interrogated and thefollowing evidences were obtained:EMILIA: 1. I did not steal it;4. I have never stolen anything in my life;5. Tadas stole it;JUDITH: 1. I did not steal it;4. My father is rich enough and I have my own wallet;5. Rita knows who did it;DARIUS: 1. I do not know anything about stealing;4. I met Rita one year ago;TADAS:5. Tadas did it;1. I am innocent of this crime;4. Rita did it;5. Emilia is lying when she says I did it;RITA: 1. I did not steal the wallet ;4. Judith is guilty;5. Darius can vouch for me, because we are friends from childhood;Further interrogation let to determine that all five persons gave two true and onefalse evidence.Task. Determine from the given data of interrogation, who had stolen the wallet.Explain your solution.209. Interesting Sequence. Sequence is generated in the following way. The firstmember is any odd natural number greater than one. Each further member is equal to:p div 2, if p is even;3p+1, if p is odd;where p is the previous member of the sequence. The sequence is finished when one(1) is obtained. For example, the first member of the sequence is equal to 7. Then thefollowing sequence is obtained:7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1Supposedly, this sequence is always finite. However, this assumption has not beenproved yet.
Task. Given the first member of sequence p (3≤p
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: 29Rank of tomatoes originallyRank o
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?