http://cs1.utm.edu/icpc/ 2026-05-03T02:55:26+00:00 http://cs1.utm.edu/icpc/ http://cs1.utm.edu/icpc/lib/tpl/dokuwiki/images/favicon.ico text/html 2018-08-15T16:40:48+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:input&rev=1534369248&do=diff Input in Python3 There is no magic bullet that leads to the fastest input and output in a programming contest. In particular, when the fastest possible source is needed competitors will have little choice but to go with C++ or Java. Having said this, there are typically multiple ways of performing and processing input and output in Python3. By understanding the options that are available and how to optimize them (e.g., conducting tests) you can see a real world performance increase, in particu… text/html 2018-08-14T19:04:45+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:input_output&rev=1534291485&do=diff Input and Output There is no magic bullet that leads to the fastest input and output in a programming contest. Having said this, there are typically multiple ways of performing and processing input and output in Python3. By understanding the options that are available and how to optimize them (e.g., conducting tests) you can see a real world performance increase, in particular when faced with high volumes of reads and writes. text/html 2018-08-16T13:18:08+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:list&rev=1534443488&do=diff Python3 Lists text/html 2019-05-07T16:19:12+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:list_comprehensions&rev=1557263952&do=diff List Comprehensions List comprehensions are used for creating lists from existing lists and other iterable structures. List comprehensions typically follow formatting similar to set-builder notation in discrete mathematics. Syntax Consider the following illustrative Python3 example for generating a list of squares: text/html 2019-05-07T12:43:14+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:lru_cache&rev=1557250994&do=diff LRU Cache Memoization is a common optimization technique where repeatedly computed values are cached for quick lookup. While memoization can be achieved by a relatively simple modification to many recursive formulations, Python3's functools library implements automatic memoization in the form of an LRU (least recently used) cache as a text/html 2018-08-15T16:33:00+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:output&rev=1534368780&do=diff Output in Python3 There is no magic bullet that leads to the fastest input and output in a programming contest. Having said this, there are typically multiple ways of performing and processing input and output in Python3. By understanding the options that are available and how to optimize them (e.g., conducting tests) you can see a real world performance increase, in particular when faced with high volumes of reads and writes. text/html 2019-05-07T16:48:03+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:priority_queue&rev=1557265683&do=diff Python3 Priority Queues Insertion & Removal import queue q = queue.PriorityQueue() q.put(10) q.put(1) q.put(5) while not q.empty(): print(q.get()) # 1 5 10 Modifying Priority Unlike C++ and Java, the standard priority queue in Python3 does not take a comparator on declaration. There are two means of dealing with a modified priority or a priority that is separate from the object: text/html 2019-05-07T13:10:46+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:recursion_depth&rev=1557252646&do=diff Recursion Depth Limits Factorial The factorial function is a canonical recursive example. Factorial has a convenient recursive definition as n! = n * (n -- 1)! where 0! = 1! = 1. The following is a standard implementation derived from this definition: def factorial(n): if n == 0: return 1 else: return n * factorial(n-1) print(factorial(997)) text/html 2018-08-09T11:00:34+00:00 Anonymous (anonymous@undisclosed.example.com) http://cs1.utm.edu/icpc/doku.php?id=python3:unpacking&rev=1533830434&do=diff Unpacking Sequences Sequences can be explicitly/implicitly unpacked into discrete, ordered units of some type. Unpacking happens automatically using the , (comma). (The syntax is also used for Tuple construction.) Unpacking works only in instances where the number of variables used