Codeforces Round 167 (Div. 1)

Solutions for Codeforces Round 167 (Div. 1) (contest 273). 0/1 problems verified against sample I/O. Difficulty range: 2400-2400.

1 items

Codeforces Round 167 (Div. 1)

Type: Div. 1 | Problems: 1 | Verified: 0/1 | Rating range: 2400-2400 | Time: 2m 13s

Problem	Name	Rating	Tags	Solve Time	Verified
D	Dima and Figure	2400	dp	2m 13s	✗

Practice › Codeforces Solutions › Codeforces Round 167 (Div. 1) ›

CF 273D - Dima and Figure

We are counting connected black-cell shapes on an n × m grid with a very strong geometric restriction. Take all painted cells as vertices of a graph, where edges connect side-adjacent painted cells. The shape must satisfy three conditions. First, at least one cell is painted.