Bit DP Problems
Published:
Bit DP is use a binary number to represent a state which a state is consisted of several varying substate(likely two states on and off), we use bit 1, 0 to represent these varying substates.
Posts by Category
algorithm
4/19 Problems
Published:
1420 Build Array Where You Can Find The Maximum Exactly K Comparisons find how many combs there exist so that 1)n ints 2)every int is leq m. 3)search cost is K(search cost will increase by 1 if current number is larger than maximum)
plan for competitive programming
Published:
I planned to start competitive programming and I will follow the tasks below. I list them so that I can regularly check my progress. Hopefully I can be a red coder in 1 year or 2. At the same time I will post problems I solved randomly. Watch on!
cpp
char arrays vs string vs char pointer and more
Published:
Note Thanks for Geeks4Geeks, I referred to their posts char * vs string vs char[] and storage for strings in C and here is my very messy note.
class revist(Chap4 of A Tour of C++)
Published:
Credit A Tour of C++, Bjarne Stroustrup
programming
char arrays vs string vs char pointer and more
Published:
Note Thanks for Geeks4Geeks, I referred to their posts char * vs string vs char[] and storage for strings in C and here is my very messy note.
class revist(Chap4 of A Tour of C++)
Published:
Credit A Tour of C++, Bjarne Stroustrup
Bit DP Problems
Published:
Bit DP is use a binary number to represent a state which a state is consisted of several varying substate(likely two states on and off), we use bit 1, 0 to represent these varying substates.
4/19 Problems
Published:
1420 Build Array Where You Can Find The Maximum Exactly K Comparisons find how many combs there exist so that 1)n ints 2)every int is leq m. 3)search cost is K(search cost will increase by 1 if current number is larger than maximum)
plan for competitive programming
Published:
I planned to start competitive programming and I will follow the tasks below. I list them so that I can regularly check my progress. Hopefully I can be a red coder in 1 year or 2. At the same time I will post problems I solved randomly. Watch on!
todo
plan for competitive programming
Published:
I planned to start competitive programming and I will follow the tasks below. I list them so that I can regularly check my progress. Hopefully I can be a red coder in 1 year or 2. At the same time I will post problems I solved randomly. Watch on!