Codeforces Beta Round 86 (Div. 2 Only)

Solutions for Codeforces Beta Round 86 (Div. 2 Only) (contest 114). 2/2 problems verified against sample I/O. Difficulty range: 1000-1500.

2 items

Codeforces Beta Round 86 (Div. 2 Only)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1500 | Time: 4m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cifera	1000	math	1m 58s	✓
B	PFAST Inc.	1500	bitmasks, brute-force, graphs	2m 19s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 86 (Div. 2 Only) ›

CF 114A - Cifera

We are given two integers, k and l. The task is to determine whether l can be written as an exact power of k. In other words, we need to check whether there exists a non-negative integer n such that: $l = k^n$ If such an n exists, we print "YES" and also print the importance…

Practice › Codeforces Solutions › Codeforces Beta Round 86 (Div. 2 Only) ›

CF 114B - PFAST Inc.

We are given a small group of people and a list of pairs who cannot work together. We need to choose the largest possible subset such that every pair inside the chosen group is compatible. This is naturally a graph problem. Think of each volunteer as a vertex.