Відео

in problem E i dont understand why we have taken the prefix array size as n+1 can anyone help?

sir post for AtCoder Beginner Contest 391

Monokarp has a positive integer n . He decided to represent this number as a sum of distinct positive integers c1+c2+⋯+ck=n (ci>0 ), where the number of elements can be arbitrary. At the same time, Monokarp wants the product of all ci to be as large as possible. Help Monokarp find such a set of distinct integers c1,c2,…,ck such that the sum of all ci equals n , and the product of all ci is maximized. The number of elements in the decomposition can be arbitrary. Input The first line contains a single integer t (1≤t≤10 ) - the number of test cases. The first line of each test case contains one integer n (1≤n≤200) - Monokarp's number. Output For each test case, output two lines: in the first line, output two integers m and k - the maximum product c1⋅c2⋅c3⋅⋯⋅ck and the number of integers in the optimal representation of the number n . In the second line, output k distinct integers c1,c2,…,ck (ci>0 ) such that the sum of all ci equals n , and the product of all ci is maximized. You can print ci in any order. If there are multiple answers, output any of them. Example InputCopy 3 1 9 5 OutputCopy 1 1 1 24 3 4 3 2 6 2 3 2 Note In the first test case, n=1 , so the only possible representation of the number n consists of one integer 1 . In the second test case, n=9 . An optimal representation, for example, is 4+3+2=9 . The product of ci is 4⋅3⋅2=24 . This is the maximum product among all decompositions. In the third test case, n=5 , and one of the optimal representations is 3+2=5 . give code of this

sir please post Atcoder solutions regularly

Keep posting at coder solution ple

For those who have doubt for question asked in stream for problem D : Test case : l = 777521061246424782 r = 954979436481808231 g = 2051248906594353 in this case g(l,r) and g(l,r-1) and even g(l+1,r) all are not equal to 1 after converting l to (l+g-1)/g and r = r/g;

Thank you sir

Was missing the CF and AtC solution streams for some time :)

Sir plssss do abc 389 contest No videos are available and editorial is useless as usual

thank you, needed this

thank you bro for starting Atcoder contest solutions again. No one else is posting Atcoder solution on yt really thank u soo much :)

for problem c i did sorting and 2 pointer

where round 1000?

Yo, demoralizer is back

in problem F if prod[1] = n how ?? we can have only one array having product 1. All the elements of this array will be 1. can you please explain how prod[1] = n

Bhai Aap kaha job krte ho Right now ??

Thank You Sir ❤

Perfect bhai ♥️

bro your explaining skill is top notch really!

very well explained, thank you!

sir please also upload codeforces contest solutions..

this is really good very in depth explanation great job

Thanks sir for the post discussion got stuck in 3rd problem thought of applying level wise dfs

Thanks for this type of cp content aryan sir

Commenting for content and players and better reach. Honest thoughts: 1. My specialist ass is getting depressed watching them kill problems which generally kills me. 2. Keep making such content for at least at my small rank it feels very motivating Idea: It would be nice to watch a speedrun to 10 problems first out of a given set of say 17 problems of rating 1700-2200 maybe as it feels good to keep thinking together as they think. Maybe a naive idea but I will surely watch it and do problems side by side.

@Aryan sir, You are good friend with Neal sir, it would be great if you could bring him for duel 😁Would love to see him in a duel .... Please try to make it happen 🙏

Respect for both participants!! What enthusiasm and smile on their faces! I truly loved to watch them code.

I didn't knew dominator is that cute❤ Ahh what a lovely format, I'm loving it💕

Bring tourist as well, we deserve him !

Orz dominator069

Who are going to be in the next duel

Keep it up the good content guys!

My comment: Here is an idea to experiment on some future duels. Duel can be between two pairs of 2400+ rated users where for each round you choose 2 (up to 2400 codeforces difficulty rating) problems that are not solved by any of 4 duelists and then each pair split 2 problems so that each duelist solves only 1 problem without trying to solve the other one at all and then the main point is that each duelist can not write the solution for the problem player A solved but player A must collaborate with the other teammate (player B) in a way where the other teammate is using whiteboard and explaining all about the problem that this other teammate (player B) solved and giving instructions on what to write in order to solve the problem solved by the problem B. The same thing for problem solved by player A has to give instruction and explain all bits of the solution to player B. You could also have 3 streams separate where you have one main stream for your commentary and splitting between the other 2 streams where these 2 other streams each is for each pair of duelists with their commentary and screen share. Like the main points is in this solution explaining to the other teammate which could be interesting to see how top rated people come up with solutions. Maybe there doesn't even have to be any round but basically a set of problems that are not solved by any competitor like 5 problems or such and then each duelist marks the problem he is doing so the other one does not try to solve it and they have some time limit like 1h or 2h and are just trying to solve as many as possible. Also problems should be picked so they are not implementation heavy because that would be really hard I assume to code for the other person getting instruction, so maybe keep problems around 2000 cf rating difficulty or such so it keeps the stream quick paced and have something going at all time for majority of viewers to watch and learn something from the stream. This is just a rough idea with main focus on this solution explaining to the other teammate, I guess other people can give more suggestions and figure what could be done better and so. Anyway this ended up bit of a longer write up. Thanks for the streams. ================================================= Revised and more concise version of my comment by chatgpt: Here is an idea to experiment with for future duels. A duel could involve two pairs of 2400+ rated users. For each round, you could select two problems (with a maximum difficulty of 2400 Codeforces rating) that none of the four duelists have solved before. Each pair would then split the two problems so that each duelist solves only one problem without attempting the other. The twist is that no duelist is allowed to write the solution to the problem they solved. Instead, they must collaborate with their teammate. For example, player A explains the solution to the problem they solved to their teammate, player B, who codes the solution based on player A's explanation. The same applies in reverse-player B must explain and guide player A in coding the solution for the problem they solved. This format could be enhanced by having three separate streams: A main stream for your commentary, which alternates between the pairs. Two additional streams, one for each pair of duelists, with commentary and screen sharing. The main focus is on the solution explanation and collaboration between teammates, which could be fascinating to watch as it showcases how top-rated players approach problem-solving and communicate their ideas. You could also eliminate the concept of "rounds" and instead have a set of unsolved problems (e.g., 5 problems). Each duelist selects a problem to solve, ensuring no overlap, and the teams have a set time limit (e.g., 1 or 2 hours) to solve as many as possible. To keep the stream engaging, the problems should not be implementation-heavy, as this would make it difficult for one person to code based on another's instructions. Instead, problems around a 2000 Codeforces rating would likely be ideal, as they strike a balance between difficulty and fast pacing, keeping the stream interesting for viewers. This is just a rough idea focusing on the solution explanation aspect. I’m sure others can provide additional suggestions to improve this concept further. Thanks for the streams! ================================================= TLDR also by chatgpt lol chatgpt is the best: Proposed a duel format with two pairs of 2400+ rated users. Each duelist solves one problem (max 2400 rating) from a shared set of unsolved problems, then explains their solution to their teammate, who codes it based on the explanation. Focus is on collaboration and showcasing top players' problem-solving and communication skills. Suggested streams for commentary and screen sharing, a time limit (e.g., 1-2 hours), and selecting problems (~2000 rating) that aren't implementation-heavy to keep it engaging for viewers. Open to further suggestions to refine the idea.

First time seeing dominator

denominator to bhout neend mai lag raha hai😪

Cool ❤

Nice duel ...

keep them coming!

Wow! This is so cool. Always wanted to see how Dominater solves problems

Damn, the elimination of n colour states was so good. Thanks.. Please keep uploading videos of such hand-picked good questions.

Scrasse orz orz Dominator orz orz

Cp is about to be chess....1v1

This is amazing to see🎉❤

wow this can be the future of cp🎉 looking forward to tourist vs jiangly 1v1 someday

I guess vMix can help to stream both the participants screen at the same time

Congrats 👏🎉

Congrats to both the participants.

Congo.. shreyan for day 1 and best of luck for day 2

❤🎉

Rank of dhirubhai ambani institute of information technology