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?
How do you indent?
No indentation (you need help)
Best language for CP?
What type of variable do you prefer?
How do you bfs/dfs?
Deque for bfs, recursion for dfs
Some from the comments:
(C/C++ only) How do you I/O?
What range do you use?
Segment Tree
Indexing
Modulo
Debugging
Lambda or function?
(Inspired by neal.fun)
Auto comment: topic has been updated by AksLolCoding (previous revision, new revision, compare).
Auto comment: topic has been updated by AksLolCoding (previous revision, new revision, compare).
Auto comment: topic has been updated by AksLolCoding (previous revision, new revision, compare).
Assume S1 is true. Then S2, S3, S4, S5, and S6 must all be true. But if S2 is true, it would mean that S3, S4, S5, and S6 are all false. This is a direct contradiction, so S1 must be false.
Assume S2 is true. Then S3, S4, S5, and S6 must all be false. However, if S1 is false, S2 true, and S3 false, then exactly one of S1, S2, S3 is true (only S2 is true), which would make S4 true. This contradicts the assumption that S4 is false, so S2 must be false.
S3 says "Both of the statements above are true." Since S1 and S2 are both false, S3 is false.
S4 says "Exactly one of the three statements above is true." For S1, S2, and S3, all are false (0 true), so S4 is false.
S5 says "None of the four statements above are true." We have S1, S2, S3, and S4 all false. This makes S5 true.
S6 says "None of the five statements above are true." But since S5 is true, not all of S1–S5 are false, so S6 must be false.
Conclusion: Only S5 is true.
bro was challenging 4-sat problem
Try this one:
This statement is false
Y'all sleeping on Python
too slow "C++ can be up to 100 times faster than Python for certain tasks."
Really? Who could've thought
Well you did say everyone's sleeping on python I'm just saying python is too slow, especially for cp
The thing is everyone knows that, Python's got other strong sides.
You just need Fast I/O and Smart Hashing and it works fine
Not much into python so can't debate too much :)
How would you hash this? https://www.youtube.com/watch?v=VioxsWYzoJk&pp=ygUnY291bnRpbmcgdG8gMSBiaWxsaW9uIGluIHB5dGhvbiBhbmQgY3Bw
C++ is the undisputed king of CP, too many benefits over python.
Writing an O(n) algorithm for n=10**9 is idiotic anyway. Both of the solutions would TLE here.
Which one is better cin/cout or scanf/printf?
Added to the post
Does having a anime girl as your pfp effect your rating?
Which one gives you most rating:
Being more russian
Being more weeb
Cheating using chatgpt
Very True. I changed to anime girl pfp and my rating went to pupil (1320). then i changed to Undertaker and its going down man wtf ! How does this work lol?
Who tf uses deque for dfs?
At least 59 people
i use deque for bfs, but recursion for dfs
Suggestion: Do you use Inclusive-Inclusive [L,R] ranges or Inclusive-Exclusive [L,R) ranges?
Suggestion 2: Do you use node-based (pointer) or array-based segment tree?
me using both [l, r] and [l, r) depending on what i feel like that day...
Added
wow nice initiative, thanks
yw
Auto comment: topic has been updated by AksLolCoding (previous revision, new revision, compare).
How do you write the functions on a segment tree? Recursive — iterative
Added
Suggestion: Map vs. Unordered_map
1 indexed vs 0 indexed (genuinely curious, been encouraged to 1 index moreso trying to see whats usually more common altho cf automatically 1-indexes so might be biased)
Added
Auto comment: topic has been updated by AksLolCoding (previous revision, new revision, compare).
added 1
2 is similar to global or local variable
Suggestion: Which one do you use for debugging, print debugging, or your editor debugging?
Added
You have segmentation fault. Do you
rage quit
use
cerr?
3- use a debugger :D
We need different option for DFS and BFS, deque for BFS and recursion for DFS.
Added
Auto comment: topic has been updated by AksLolCoding (previous revision, new revision, compare).
Where is 3 spaces identation?
Added
how you do you bfs using recursion?
Auto comment: topic has been updated by AksLolCoding (previous revision, new revision, compare).
template or no template.
I use queue for BFS and recursion for DFS.
Tester or Hacker
c++ recursive lambda
auto &selfin argsstd::functionc++23
this autodfs on python
impossible
possible