Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition)

Solutions for Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) (contest 181). 2/2 problems verified against sample I/O. Difficulty range: 800-1300.

2 items

Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1300 | Time: 4m 22s

Problem Name Rating Tags Solve Time Verified
A Series of Crimes 800 brute-force, geometry, implementation 2m 48s ✓
B Number of Triplets 1300 binary-search, brute-force 1m 34s ✓
Practice › Codeforces Solutions › Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) ›

CF 181A - Series of Crimes

We are given a map of a city as an n × m grid, where each cell represents a district. Three of the districts have been robbed, marked by , and all other districts are empty (.).
codeforces competitive-programming brute-force geometry implementation May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) ›

CF 181B - Number of Triplets

We are given a set of distinct points on a 2D plane. The task is to count how many unordered triples of points form a configuration where one point lies exactly at the midpoint of the segment formed by the other two.
codeforces competitive-programming binary-search brute-force May 29, 2026