Šeštadieninė informatikos olimpiadininkų mokykla

Algoritmų sudėtingumas

• [1] 2019-11-02 12:20 (0)
• [2] 2019-11-02 13:43 (50)
• [3] 2019-11-02 13:49 (50)
• [4] 2019-11-02 13:50 (50)
• [5] 2019-11-02 18:53 (60)
• [6] 2019-11-03 19:06 (20)
• [7] 2019-11-03 19:19 (60)
• [8] 2019-11-03 20:01 (70)
• [9] 2019-11-04 19:52 (50)
• [10] 2019-11-04 20:03 (60)
• [11] 2019-11-04 20:41 (70)
• [12] 2019-11-04 20:47 (50)
• [13] 2019-11-04 20:58 (50)
• [14] 2019-11-04 20:59 (50)
• [15] 2019-11-06 19:46 (60)
• [16] 2019-11-06 19:51 (90)
• [17] 2019-11-06 19:53 (90)
• [18] 2019-11-06 19:55 (90)
• [19] 2019-11-06 21:35 (90)
• [20] 2019-11-06 23:09 (90)
• [21] 2019-11-07 18:52 (100)
• [22] 2021-11-15 21:50 (70)
• [23] 2021-11-15 21:53 (70)
• [24] 2021-11-15 22:08 (60)
• [25] 2021-11-15 22:10 (70)
• [26] 2021-11-15 22:19 (80)
• [27] 2021-11-16 20:46 (70)
• [28] 2021-11-16 20:47 (70)

Taškai: 50

Compile: OK

nr.	result	time	message
1	True	0.0 s	ok
2	False	0.0 s	Neteisinga eilutė
3	True	0.0 s	ok
4	True	0.0 s	ok
5	False	0.0 s	Neteisinga eilutė
6	True	0.0 s	ok
7	False	0.004 s	Neteisinga eilutė
8	False	0.0 s	Neteisinga eilutė
9	True	0.0 s	ok
10	False	0.004 s	Neteisinga eilutė