By tourist, 10 months ago,

1782A - Parallel Projection

Explanation
Source

1782B - Going to the Cinema

Explanation
Source 1
Source 2

1782C - Equal Frequencies

Explanation
Source

1782D - Many Perfect Squares

Explanation
Source

1782E - Rectangle Shrinking

Explanation
Source

1782F - Bracket Insertion

Explanation
Source

1782G - Diverse Coloring

Explanation
Source (2nd approach)

1782H1 - Window Signals (easy version)

Explanation
Source for easy version
Source for hard version
• +253

 » 10 months ago, # |   +14 NiceEditorial is here)
 » 10 months ago, # | ← Rev. 2 →   +34 omg tourist Editorial
•  » » 10 months ago, # ^ |   +10 omg tourist Editorial
•  » » » 10 months ago, # ^ |   0 omg tourist Editoral
•  » » 10 months ago, # ^ |   +52 Do you know why your comment was downvoted? Probably not. Actually, the same comment can be upvoted in a different time/place.A possible reason is that some random person just randomly downvoted your comment and then some other insane users just continue downvoting without thinking. Toxic, crazy, but this is the reality here.
 » 10 months ago, # | ← Rev. 2 →   +8 A simple solution to problem E:The solution for height = 1 is trivial. I'll discuss about a similar solution for height = 2.Step 1 : Solve the trivial problem for the rectangle covers both rows only.Step 2 : Let's detach the rectangles we chose in step 1 into 2 rectangles in the first and second row.Step 3 : Solve the trivial problem for each rows.Step 4 : Merge the rectangle in step 2.Caution: for the rectangles created in step 2, you can only remove or keep them without shrinking.My submission: 189882008
•  » » 10 months ago, # ^ |   0 adu sir thanhchauns2 manh wa
 » 10 months ago, # |   0 Why are there so few upvotes on this blog?
•  » » 10 months ago, # ^ |   +23 Why are there so few upvotes on this comment?
 » 10 months ago, # |   -31 Lightning Speed editorial!!
 » 10 months ago, # | ← Rev. 2 →   +6 I would recommend replacing "Source" with "(Source) Code", at first glance I thought it was the inspiration or the source of the problem :D
 » 10 months ago, # |   0 thank you
 » 10 months ago, # |   0 what is the fast factorization method in in problem D.
•  » » 10 months ago, # ^ |   +1 Check all numbers n where n*n<=p and n>=1 where p is the number you want to factor. The factors will always be when p%n==0 and the factors themselves will be n and p/n. This works because when we check all numbers less than or equal to sqrt of p, the following pair(p/n) will get all the numbers greater than or equal to sqrt of p.
•  » » » 10 months ago, # ^ |   0 This is the general factorization I thought there is faster factorization method possible for this. By the way how to optimize the second part of the problem.
 » 10 months ago, # |   0 Can anyone please explain C a little bit detailed
•  » » 7 months ago, # ^ |   +1 We iterate through all the divisors of length N of string, and for each character greedily try to change them so that equal frequencies can be maintained. The greedy idea for constructing the string is explained in the editorial.Here's a link to my submission, maybe the top submissions would be shorter: https://codeforces.com/contest/1781/submission/206606856
 » 2 months ago, # |   0 what is faster factorization methods in D- Many Perfect Squares