title

Hello, So I was solving 718C - Саша и массив, and it required me to code a whole matrix struct by itself, it doesn't support everything, but it's fine ig. I searched but couldn't find anything, I remember jiangly used it in one of his submissions but I couldn't find it. Does anyone mind sharing their own?

Mine: https://ideone.com/EYkUS2

What is a Y combinator where I see some ppl using it, it looks something like this:

template<class F>
struct y_combinate_t {
  F f;
  template<class...Args>
  decltype(auto) operator()(Args&&...args)const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template<class F>
y_combinate_t<std::decay_t<F>> y_combinate( F&& f ) {
  return {std::forward<F>(f)};
};

Hello, For the problem 1187D - Subarray Sorting, I'm receiving Wrong answer on test 2, I can't understand why, I appreciate any helps
submission: 262289153

Thx

Disclaimer: this is a controversial post, at least for an specialist

Is it just Me who thinks that BledDest problems are pure bullshit and shouldn't be qualified for educational rounds? Like think about it, His problems are always solved with a combination of tools and techniques that if u never heard about any of them before, u gonna have a hard time during the contest, the problems should be educational, not Put a range of ideas and tools together to solve them, Almost all of his problems require a technique(which almost no div3 or div4 user can conclude, and many div2 users if not seen that will have a hard time), or just pure bullshit with no beauty, Like man have some beautiful problems, something that a average person can conclude if not seen before

Hello codeforces, I need help, I have this 258568779 for 21D - Traveling Graph, which as you can see it causes MLE with 65 use of memory, I changed every long long to int, reduced MXN to 16, and minimized the use of arrays, but still it causes MLE, can someone help please?

Thanks