JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
ACM ICPC Trainings. Telecom ParisTech. 2017. Questionnaire.
Sign in to Google
to save your progress.
Learn more
Surname and name
Your answer
Codeforces handle
Your answer
Topcoder handle
Your answer
Data structures
Stack & Queue
1
2
3
4
5
Clear selection
Segment Tree
1
2
3
4
5
Clear selection
2D Segment Tree
1
2
3
4
5
Clear selection
Fenwick Tree
1
2
3
4
5
Clear selection
Treap
1
2
3
4
5
Clear selection
Strings
Z- and prefix- functions
1
2
3
4
5
Clear selection
Hashing
1
2
3
4
5
Clear selection
Trie and Aho-Corasick algorithm
1
2
3
4
5
Clear selection
Suffix data structures.
1
2
3
4
5
Clear selection
Graphs
DFS and BFS
1
2
3
4
5
Clear selection
Dijkstra algorithm
1
2
3
4
5
Clear selection
Floyd algorithm
1
2
3
4
5
Clear selection
Minimal Spanning Tree Algorithms
1
2
3
4
5
Clear selection
Maximal Matching in Bipartite Graph. Kuhn algorithm.
1
2
3
4
5
Clear selection
Maximal Flow. Dinic algorithm.
1
2
3
4
5
Clear selection
Search of LCA
1
2
3
4
5
Clear selection
Heavy-light decomposition
1
2
3
4
5
Clear selection
Centroid decomposition
1
2
3
4
5
Clear selection
Auxiliary
Binary and Ternary searches
1
2
3
4
5
Clear selection
Convex hull
1
2
3
4
5
Clear selection
Fast Fourier Transform
1
2
3
4
5
Clear selection
Any other topic you want to hear?
Your answer
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google. -
Terms of Service
-
Privacy Policy
Does this form look suspicious?
Report
Forms
Help and feedback
Contact form owner
Help Forms improve
Report
