We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Game Theory
  4. Misère Nim
  5. Discussions

Misère Nim

  • ihorfinance
     + 0 comments

    C++ (more at https://github.com/IhorVodko/Hackerrank_solutions/tree/master , feel free to give a star :) )

    std::string misereNim(std::vector<int> const & _piles){
    int binSum = 0;
    int sum = 0;
    for(auto const & stones : _piles){
        binSum ^= stones;
        sum += stones;
    }
    if(_piles.size() == sum){
        return _piles.size() % 2 == 0 ? "First" : "Second";
    }
    return binSum ? "First" : "Second";
}