Codeforces Round 666 (Div. 2)

Solutions for Codeforces Round 666 (Div. 2) (contest 1397). 1/2 problems verified against sample I/O. Difficulty range: 800-1500.

2 items

Codeforces Round 666 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1500 | Time: 6m 55s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Juggling Letters	800	greedy, strings	1m 45s	✓
B	Power Sequence	1500	brute-force, math, number-theory	5m 10s	✗

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

CF 1397B - Power Sequence

We are given an array of positive integers and we are allowed to reorder it arbitrarily. After choosing an order, we want to transform the array into a very rigid pattern: the first element should be 1, the second should be some fixed number c, the third c squared, and so on…

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

CF 1397A - Juggling Letters

We are given a set of strings, and we can move characters freely between any strings, including moving a character from a string back into itself. The goal is to determine if it is possible to rearrange all the characters so that every string ends up identical.