HELLO CODERS

i found this dp problem on leetcode (ones and zeros) (https://leetcode.com/problems/ones-and-zeroes/) i solved it using 3 states [position][no_of_zeros][no_of_ones] its giving me memory limit exceeded i saw some people using 2d state [no_of_zeros][no_of_ones] .i cant understand how they come up with their solution .help me explaining their 2 d concept. MY solution link solution although the time complexity of my code and thier code is same.

i have registered in ACM-ICPC gwalior region(ASIA country-INDIA) till yet our team status is pending we have done our payment as well as we have done mail to gwalior region .what should we do? Can we still do participation in Online round tomorrow contest??

i want to know from where i can kearn gaussian elimination ?if u can provide some video that will be also good or any blog pls or if u can teach me here with good set of example !

include<boost/multiprecision/cpp_int.hpp>

namespace mp = boost :: multiprecision; this header file is supported in codechef for big integer why not in codeforces?

i just want to start learning dp .but from which problem should i start first?

i m able to use c++ but C++ 14 is not working as well as how can i setup atom for competetive programming .i mean to say . i want to give input at once that one input and other output file

MAXIMUM XOR USING K ELEMENT IN ARRAY

for example

5 3
1
2
3
4
5
 

here no of element=5,k=3; here OUTPUT IS 7 how to approach this type of problm with or without recursion which one is easier source= https://www.spoj.com/problems/CODEIT02/