Coding Challenge Alpha VII - by Algorave

6 problems from Coding Challenge Alpha VII - by Algorave (contest 105348), difficulty -. 0/6 solutions verified against sample I/O.

6 items

Coding Challenge Alpha VII - by Algorave

Special | 6 problems | 0/6 verified | Difficulty - | 15m 1s

#	Problem	Time
A	Try and Cry	1m 52s
B	And Xor Pair	5m 51s
C	String Traversal Paradigm 1	1m 33s
D	String Traversal Paradigm 2	2m 24s
E	Restricted Diameter	1m 35s
F	Sub Permutation	1m 46s

Practice › Codeforces Solutions › Coding Challenge Alpha VII - by Algorave ›

CF 105348B - And Xor Pair

We are asked to count how many ordered pairs of integers $(x, y)$ can be formed from a given number $n$, under two binary constraints applied bit by bit.

Practice › Codeforces Solutions › Coding Challenge Alpha VII - by Algorave ›

CF 105348F - Sub Permutation

We are given a permutation of size $n$, and we need to consider every contiguous subarray. For each subarray, we take its elements and replace them with their relative ranks inside that subarray.

Practice › Codeforces Solutions › Coding Challenge Alpha VII - by Algorave ›

CF 105348E - Restricted Diameter

We are given a tree, and for every node we want to measure how “large” a path can become if we force that node to lie somewhere on the path. More precisely, fix a node i.

Practice › Codeforces Solutions › Coding Challenge Alpha VII - by Algorave ›

CF 105348D - String Traversal Paradigm 2

Codeforces 105348D: String Traversal Paradigm 2

Practice › Codeforces Solutions › Coding Challenge Alpha VII - by Algorave ›

CF 105348C - String Traversal Paradigm 1

We are given a string s of length n, and we should think of every occurrence of a character as a position on a line. Moving between two positions has a cost that depends on whether the characters are the same.

Practice › Codeforces Solutions › Coding Challenge Alpha VII - by Algorave ›

CF 105348A - Try and Cry

We are given a round-robin tournament with $N$ teams where every pair plays exactly one match and every match produces a winner. A win gives 1 point, a loss gives 0 points. After all matches, teams are ranked by total points, and ties are resolved using run rate.