Let's turn the controversy up to 11 (not in binary). Feel free to post some more polls in the comments if you want to↵
↵
**What is this data structure called?**↵
↵
Disjoint Set Union [likes:1,option1]↵
↵
Union-Find [likes:1,option2]↵
↵
**How do you indent?**↵
↵
2 Spaces [likes:2,option1]↵
↵
4 Spaces [likes:2,option2]↵
↵
Tabs [likes:2,option3]↵
↵
No indentation (you need help) [likes:2,option4]↵
↵
**Best language for CP?**↵
↵
C [likes:3,option1]↵
↵
C++ [likes:3,option2]↵
↵
Python [likes:3,option3]↵
↵
Java [likes:3,option4]↵
↵
**What type of variable do you prefer?**↵
↵
Local [likes:4,option1]↵
↵
Global [likes:4,option2]↵
↵
**How do you bfs/dfs?**↵
↵
Deque [likes:5,option1]↵
↵
Recursion [likes:5,option2]↵
↵
Some from the comments:↵
↵
**(C/C++ only) How do you I/O?**↵
↵
Cin/cout [likes:6,option1]↵
↵
Printf/scanf [likes:6,option2]↵
↵
Custom superfast io [likes:6,option3]↵
↵
**What range do you use?**↵
↵
inclusive-inclusive [l,r] [likes:7,option1]↵
↵
[l,r)↵
inclusive-exclusive [likes:7,option2]↵
↵
exclusive-exclusie (l,r) [likes:7,option3]↵
↵
**Segment Tree**↵
↵
Array based [likes:8,option1]↵
↵
Pointer based [likes:8,option2]↵
↵
Recursive [likes:9,option1]↵
↵
Iterative [likes:9,option2]↵
↵
**Indexing**↵
↵
0-index [likes:10,option1]↵
↵
1-index [likes:10,option2]↵
↵
**Modulo**↵
↵
1000000007 [likes:11,option1]↵
↵
998244353 [likes:11,option2]↵
↵
(Inspired by [neal.fun](https://neal.fun/lets-settle-this/))
↵
**What is this data structure called?**↵
↵
Disjoint Set Union [likes:1,option1]↵
↵
Union-Find [likes:1,option2]↵
↵
**How do you indent?**↵
↵
2 Spaces [likes:2,option1]↵
↵
4 Spaces [likes:2,option2]↵
↵
Tabs [likes:2,option3]↵
↵
No indentation (you need help) [likes:2,option4]↵
↵
**Best language for CP?**↵
↵
C [likes:3,option1]↵
↵
C++ [likes:3,option2]↵
↵
Python [likes:3,option3]↵
↵
Java [likes:3,option4]↵
↵
**What type of variable do you prefer?**↵
↵
Local [likes:4,option1]↵
↵
Global [likes:4,option2]↵
↵
**How do you bfs/dfs?**↵
↵
Deque [likes:5,option1]↵
↵
Recursion [likes:5,option2]↵
↵
Some from the comments:↵
↵
**(C/C++ only) How do you I/O?**↵
↵
Cin/cout [likes:6,option1]↵
↵
Printf/scanf [likes:6,option2]↵
↵
Custom superfast io [likes:6,option3]↵
↵
**What range do you use?**↵
↵
inclusive-inclusive [l,r] [likes:7,option1]↵
↵
↵
exclusive-exclusie (l,r) [likes:7,option3]↵
↵
**Segment Tree**↵
↵
Array based [likes:8,option1]↵
↵
Pointer based [likes:8,option2]↵
↵
Recursive [likes:9,option1]↵
↵
Iterative [likes:9,option2]↵
↵
**Indexing**↵
↵
0-index [likes:10,option1]↵
↵
1-index [likes:10,option2]↵
↵
**Modulo**↵
↵
1000000007 [likes:11,option1]↵
↵
998244353 [likes:11,option2]↵
↵
(Inspired by [neal.fun](https://neal.fun/lets-settle-this/))
