By tourist, 2 weeks ago, In English

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
 
 
 
 
  • Vote: I like it
  • +268
  • Vote: I do not like it

»
2 weeks ago, # |
  Vote: I like it +14 Vote: I do not like it

Nice

Editorial is here)

»
2 weeks ago, # |
Rev. 2   Vote: I like it +34 Vote: I do not like it

omg tourist Editorial

  • »
    »
    2 weeks ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    omg tourist Editorial

  • »
    »
    2 weeks ago, # ^ |
      Vote: I like it +52 Vote: I do not like it

    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.

»
2 weeks ago, # |
Rev. 2   Vote: I like it +8 Vote: I do not like it

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

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Why are there so few upvotes on this blog?

»
2 weeks ago, # |
  Vote: I like it -31 Vote: I do not like it

Lightning Speed editorial!!

»
13 days ago, # |
Rev. 2   Vote: I like it +6 Vote: I do not like it

I would recommend replacing "Source" with "(Source) Code", at first glance I thought it was the inspiration or the source of the problem :D

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

thank you

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

what is the fast factorization method in in problem D.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    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.

    • »
      »
      »
      8 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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.

»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone please explain C a little bit detailed