Codeforces Round 153 (Div. 2)

Solutions for Codeforces Round 153 (Div. 2) (contest 252). 1/2 problems verified against sample I/O. Difficulty range: 1100-1800.

2 items

Codeforces Round 153 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 1100-1800 | Time: 3m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Little Xor	1100	brute-force, implementation	1m 21s	✗
B	Unsorting Array	1800	brute-force, sortings	2m 7s	✓

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

CF 252A - Little Xor

We are given a sequence of non-negative integers and we want to pick a contiguous block of elements such that when we take the bitwise XOR of everything inside that block, the result is as large as possible.

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

CF 252B - Unsorting Array

We are given an array of integers of length n and asked to determine if we can swap any two elements at distinct positions such that the resulting array is no longer sorted. Sorting here is defined broadly: the array is sorted if it is either non-decreasing or non-increasing.