B. I Hate 1111 | Codeforces Round 723 (Div-2)

[@arpitpandey992]

Great explanation, good to know the mathematical answer, I solved it using brute force during the contest, but was not feeling satisfied.

[@singha539]

Could you please share your brute force code here?

[@satyamsingh9799]

Please share the code

[@arpitpandey992]

@@singha539 There you go :) map DP; vll a{11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111}; int dp(int x) { if (x < 11) return false; if (DP.find(x) != DP.end()) return DP[x]; for (auto y : a) { if (x % y == 0) return DP[x] = true; } bool ans = false; for (auto y : a) { if (ans) break; ans = ans | dp(x - y); } return DP[x] = ans; } int main() { fastio; test { int x; cin >> x; cout

[@pragatsharma1580]

@@arpitpandey992 can we do any q by dp i still do not know how to do dp q can you please share how you learnt dp

[@Infinity-squre]

thanku bhai best explanation

[@mittshah9598]

The best explanation on youtube!

[@asishcodes]

Thanks for this explanation

[@manish_02291]

bhai video q band kar di live stream kro plz

[@inspired_enough_to_grow_up]

bhai nhi ho paayi thi 😫😓

[@ShivamKumar-eu6mf]

Bhaiya great work you are doing , your explanations are , after seeing your explanations are uploaded , le me - " abhi mja ayega na bidu"🙂

[@kassutta]

😃😃

[@anupamgarg8746]

@@kassutta please upload the explanations of the rest problems of the contest. Your way of explanation is amazing.

[@kassutta]

@@anupamgarg8746 will try from next onwards , thanks 🙏

[@adityasingh841]

Bhai bahot acha explain kiya , acha laga video

[@RudraSingh-pb5ls]

What about C ?

[@roshanjha9045]

Bhaiya Aman bhaiya ka new video kab aaye ga

[@mohdaasimqureshi7115]

your video editorials are best for cf rounds

[@paraslaul3307]

bhai kaunsi company ka drawing tablet use krte ho?Please tell

[@kassutta]

Mine is Viekk S640 but jb mane liya tha to yhi stock m tha pr isse badiya h or bhi HUION ya for WACOM, try them.

[@abhaymishra3084]

👌👌👌

[@kushalbanda8580]

Bhai, great explanation. Why don't you work with codeforces team to spread the logic or the important observation in the question after the competition, just like codechef does with it's team of coders.

[@kassutta]

As a tester I can suggest them with easy solutions or a different approach but I was not a tester in this, but otherwise I don't know how to connect with them.

[@abhaymishra3084]

👍👍👍

[@priyanshuupadhyay9433]

Bhai, Can you explain what this line means ? mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());

[@jaydeep-p]

Counting the time of execution right?

[@akakop]

useful in calculating the time of execution. but this statement calculates time since start of epoch i.e. 00:00:00 UTC on 1 January 1970. you have to use the above statement twice to calculate execution time of a set of statements.

[@learner_1228]

bro,can you make a video editorial of C using dp & greedy both?

[@kassutta]

I think greedy is easy i.e, It's simple greedy you can see my implementation for c2 We take every number till our score is non negative , whenever our score becomes negative we remove the negative number of highest magnitude we have taken until our score becomes positive then we repeat. And I have not thought about DP so will try.

[@anirudhpanwar7142]

sahi hai

[@JEAnandkumar]

Halat kharab kar di es bogaboo ne xD!!

[@shwetadwivedi4967]

👍👍