Python Programming DSBA 2024/25 — различия между версиями

tvoznesenskaya@hse.ru, tg: @tvozn

#18: do not use nonlinear constructions: branches, cycles, functions

#11: do not use conditionals, do not use loops
#13: do not use conditionals, do not use loops
#17: do not use loops, do not use .count()

#1: do not perform unnecessary actions
#10: do not change the list
#11: you must change the list
#14: you must change the list
#15: you must change the list, you are not allowed to use additional lists
#16: you must change the list, you are not allowed to use additional lists and .insert()
#20: you must change the list, you can do only one pass through the list, you are not allowed to use additional lists

In all problems of this contest, please, make sure that the function's name,
parameters and return type correspond to the problem statement
#8: do not use pow(), do not use loops, do not use **
#9: complexity O(sqrt(n))
#10: complexity O(sqrt(n))
#11: do not use pow(), do not use **
#12: use +1 and -1 only, do not use loops
#13: complexity O(log(n))
#16: do not use loops, recursion is obligatory
#18: do not use lists, strings or similar data structures
#19: do not use lists, strings or similar data structures

no special requirements 🥳

#1: do not use additional lists, do not change the list
#3: complexity O(n)
#4: complexity O(n)
#5: do not use in-built functions, implement Counting Sort Algorithm
#10: do not use in-built functions, complexity O(len(A)+len(B))
#11: do not store the contents of the whole file in memory, only one line at a time
#13: do not store the contents of the whole file in memory, only one line at a time