Codeforces Round 263 (Div. 2)

Solutions for Codeforces Round 263 (Div. 2) (contest 462). 2/2 problems verified against sample I/O. Difficulty range: 1000-1300.

2 items

Codeforces Round 263 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1300 | Time: 2m 11s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Appleman and Easy Task	1000	brute-force, implementation	1m 2s	✓
B	Appleman and Card Game	1300	greedy	1m 9s	✓

Practice › Codeforces Solutions › Codeforces Round 263 (Div. 2) ›

CF 462A - Appleman and Easy Task

We are given an n×n board, where each cell contains either an 'x' or an 'o'. The task is to check a local property for every cell: whether the number of orthogonally adjacent cells containing 'o' is even.

Practice › Codeforces Solutions › Codeforces Round 263 (Div. 2) ›

CF 462B - Appleman and Card Game

Appleman has a collection of n cards, each labeled with a capital letter. Toastman is allowed to pick exactly k cards, and for each card he picks, Appleman pays him coins equal to the number of Toastman's cards that have the same letter as that card.