Codeforces Round 745 (Div. 2)

Solutions for Codeforces Round 745 (Div. 2) (contest 1581). 1/2 problems verified against sample I/O. Difficulty range: 800-1200.

2 items

Codeforces Round 745 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1200 | Time: 4m 54s

Problem	Name	Rating	Tags	Solve Time	Verified
A	CQXYM Count Permutations	800	combinatorics, math, number-theory	2m 30s	✗
B	Diameter of Graph	1200	constructive-algorithms, graphs, greedy	2m 24s	✓

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

CF 1581A - CQXYM Count Permutations

The outputs: show that the current algorithm is not merely suffering from a small implementation bug. It is solving a different optimization problem. Let's examine the samples: Input: Expected: Current output: 15 is simply the sum of the array.

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

CF 1581B - Diameter of Graph

We are asked to determine whether it is possible to construct a simple, connected, undirected graph with a given number of nodes n and edges m such that the graph's diameter is strictly less than k-1.