A. Shifrlash

Xotira: 32 MB, Vaqt: 1000 ms

Masala

Sizga matn beriladi, siz ushbu matnni shifrlab chop eting.

Kiruvchi ma'lumotlar:

Bitta qatorda 1≤uznligi≤100 bo'lgan matn beriladi.

Chiquvchi ma'lumotlar:

Javobni chop eting.

Izoh:

Siz uchun qo'shimcha belgilar ham kiritiladi! Siz shifr qonuniyatini topishingiz kerak!

Misollar:

#	INPUT.TXT	OUTPUT.TXT
1	salom ber	tbmpn cfs
2	zo'r bola	zp's cpmb

B. Shox

Xotira: 32 MB, Vaqt: 1000 ms

Masala

Azimjon shaxmatni o'rganayotgan edi, unda faqat bitta Shox bor.Bir kuni Olimjon unga bir n katakni berdi va Azimjon shu katakdan nechta katakga o'tishi mumkinligini so'radi.Azimjon bir oz qiynalmoqda, siz unga yordam bering!

Kiruvchi ma'lumotlar:

Sizga faqat shaxmat taxtasi kataklari beriladi(birinchi son va katta inglizcha harf)

Chiquvchi ma'lumotlar:

Javobni chop eting.

Izoh:

8x8 taxta.

Misollar:

#	INPUT.TXT	OUTPUT.TXT
1	7 B	8
2	1 H	3
3	4 A	5

C. English lesson

Xotira: 32 MB, Vaqt: 1000 ms

Masala

Olimjon ingliz tili darsida some va any ni qanday xollarda ishlatishni o'rganishayotgan edi. Lekin Olimjon darsda uxlab qolib darsni o'tkazib yubordi, ustozi esa unga uyga vazifa berdi.U bunga qiynalmoqda, siz unga yordam bering.

Kiruvchi ma'lumotlar:

Sizga matn beriladi.

Chiquvchi ma'lumotlar:

Siz matnga any va some lardan birini joylashtirib chiqaring.

Izoh:

any va some boshida ham kelishi mumkin! Va ! . ? lar bilan tugaydigon so'zlar ham kiritiladi.

Misollar:

#	INPUT.TXT	OUTPUT.TXT
1	I have _ games on my computer.I have not _ games on my computer.	I have some games on my computer.I have not any games on my computer.
2	Do you have _ money?Does she have _ breakfast?	Do you have any money?Does she have any breakfast?

#

INPUT.TXT

OUTPUT.TXT

1

I have _ games on my computer.I have not _ games on my computer.

I have some games on my computer.I have not any games on my computer.

2

Do you have _ money?Does she have _ breakfast?

Do you have any money?Does she have any breakfast?

D. Jadval

Xotira: 32 MB, Vaqt: 1000 ms

Masala

Sizga n massivi beriladi.Siz jadvalda shu massiv ichidagi sonlarni joylashtirishingiz kerak.

Jadval ning X o'qi uzunligi massivning uzunligiga teng, Y o'qi uzunligi massivning eng katta soniga teng, jadval uchun n massiv kiritiladi.Jadval nomi “Jadval” deyilishi kerak.

Kiruvchi ma'lumotlar:

Bitta qatorda n(1≤n.size≤100 & 1≤n.elements≤100) massivi kiritiladi.

Chiquvchi ma'lumotlar:

Jadvalni chop eting.

Misollar:

#	INPUT.TXT	OUTPUT.TXT
1	1,2,3,4,5,6,7,8,9,10	Jadval: \| 1 \| 2 \| 3 \| 4 \| 5 \| 6 \| 7 \| 8 \| 9 \| 10 -------------------------------------------- 1 \| 1 \| \| \| \| \| \| \| \| \| -------------------------------------------- 2 \| \| 2 \| \| \| \| \| \| \| \| -------------------------------------------- 3 \| \| \| 3 \| \| \| \| \| \| \| -------------------------------------------- 4 \| \| \| \| 4 \| \| \| \| \| \| -------------------------------------------- 5 \| \| \| \| \| 5 \| \| \| \| \| -------------------------------------------- 6 \| \| \| \| \| \| 6 \| \| \| \| -------------------------------------------- 7 \| \| \| \| \| \| \| 7 \| \| \| -------------------------------------------- 8 \| \| \| \| \| \| \| \| 8 \| \| -------------------------------------------- 9 \| \| \| \| \| \| \| \| \| 9 \| -------------------------------------------- 10 \| \| \| \| \| \| \| \| \| \| 10 --------------------------------------------
2	2,4,6,8,10	Jadval: \| 1 \| 2 \| 3 \| 4 \| 5 ------------------------ 1 \| \| \| \| \| ------------------------ 2 \| 2 \| \| \| \| ------------------------ 3 \| \| \| \| \| ------------------------ 4 \| \| 4 \| \| \| ------------------------ 5 \| \| \| \| \| ------------------------ 6 \| \| \| 6 \| \| ------------------------ 7 \| \| \| \| \| ------------------------ 8 \| \| \| \| 8 \| ------------------------ 9 \| \| \| \| \| ------------------------ 10 \| \| \| \| \| 10 ------------------------

#

INPUT.TXT

OUTPUT.TXT

1

1,2,3,4,5,6,7,8,9,10

Jadval:
  | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10
--------------------------------------------
1 | 1 |   |   |   |   |   |   |   |   |  
--------------------------------------------
2 |   | 2 |   |   |   |   |   |   |   |  
--------------------------------------------
3 |   |   | 3 |   |   |   |   |   |   |  
--------------------------------------------
4 |   |   |   | 4 |   |   |   |   |   |  
--------------------------------------------
5 |   |   |   |   | 5 |   |   |   |   |  
--------------------------------------------
6 |   |   |   |   |   | 6 |   |   |   |  
--------------------------------------------
7 |   |   |   |   |   |   | 7 |   |   |  
--------------------------------------------
8 |   |   |   |   |   |   |   | 8 |   |  
--------------------------------------------
9 |   |   |   |   |   |   |   |   | 9 |  
--------------------------------------------
10 |   |   |   |   |   |   |   |   |   | 10
--------------------------------------------

2

2,4,6,8,10

Jadval:
  | 1 | 2 | 3 | 4 | 5
------------------------
1 |   |   |   |   |  
------------------------
2 | 2 |   |   |   |  
------------------------
3 |   |   |   |   |  
------------------------
4 |   | 4 |   |   |  
------------------------
5 |   |   |   |   |  
------------------------
6 |   |   | 6 |   |  
------------------------
7 |   |   |   |   |  
------------------------
8 |   |   |   | 8 |  
------------------------
9 |   |   |   |   |  
------------------------
10 |   |   |   |   | 10
------------------------

E. Eng uzun elementlari qaytarilmagan satr

Xotira: 32 MB, Vaqt: 1000 ms

Masala

Sizga bir satr beriladi siz bu satrda eng uzun birbinini takrorlamagan satrni toishingiz kerak!

Kiruvchi ma'lumotlar:

Birinchi qatorda n(1≤n.size≤100) satri kiritiladi

Chiquvchi ma'lumotlar:

Javobni chop eting.

Misollar:

#	INPUT.TXT	OUTPUT.TXT
1	abcdbuea	abcd
2	dd	d