Codeforces Round 136 (Div. 2)

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

2 items

Codeforces Round 136 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Little Elephant and Function	1000	implementation, math	1m 10s	✓
B	Little Elephant and Numbers	1300	implementation	2m 47s	✓

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

CF 221A - Little Elephant and Function

We are given a recursive procedure that operates on a permutation of numbers from 1 to n. The function behaves like this: For f(x), it first recursively processes the first x - 1 elements, then swaps positions x - 1 and x.

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

CF 221B - Little Elephant and Numbers

We are asked to count divisors of a given positive integer x that share at least one digit with x. In other words, we examine every number d that divides x evenly and check whether there exists a digit appearing both in x and in d.