https://codeforces.com/problemset/problem/1327/E

[ganesh_6]

Problem - 1327E - Codeforces

Can anyone explain me the approach to solve this problem? I am unable to understand the codeforces editorial.

[everule1]

It’s not a dp.

Codeforces Education Round 84 E

No. Combinatorics. My submission. https://codeforces.com/contest/1327/submission/74176633 The main point is there can be n-i+1 positions for a block of size i blocks. Two of them will be at the edge, and n-i-1 will be in the middle. For the ones that are at the edges The number adjacent to it must be different. Therefore, the number of ways is 10(The block can have any number) * 9 (the number adjacent should be different), and 10^{n-i-1} for the rest of the numbers. there can be two ways that …

[ganesh_6]

Thanks a lot . You made my day @everule1