subsquare is any square piece of the stand, I. e. any set S(i0,j0,k)={ci,j | i0≤i
Correct answer will be upvoted else downvoted. Computer science.
subsquare is any square piece of the stand, I. e. any set S(i0,j0,k)={ci,j | i0≤i<i0+k,j0≤j<j0+k} with 1≤i0,j0≤n−k+1.
Kostya actually doesn't have the foggiest idea the number of tiles he wants, so he considers the subsquares of every conceivable size. He doesn't need his restroom to be excessively bright. Assist Kostya with counting for each k≤n the number of subsquares of size k×k that have all things considered q various shades of tiles. Two subsquares are considered unique if their area on the stand is unique.
Input
The main line contains two integers n and q (1≤n≤1500, 1≤q≤10) — the size of the stand and the breaking point on the number of particular tones in a subsquare.
Every one of the following n lines contains n integers ci,j (1≤ci,j≤n2): the j-th integer in the I-th line is the shade of the tile in the cell (i,j).
Output
For every k from 1 to n print a solitary integer — the number of subsquares of size k×k without any than q various shadings.
Step by step
Solved in 3 steps with 1 images
