# Solution to SGU #173 Coins

The transformation X contains two steps: Cyclic left shift Turn over (totally several times) k-th coin if i-th coin and …

Skip to content
# Simple Note

## Full of worms

# Tag: ACM

# Solution to SGU #173 Coins

The transformation X contains two steps: Cyclic left shift Turn over (totally several times) k-th coin if i-th coin and …

### April 2015

# Solution to SGU #167 I-country

# The Solution to MSBOP 2015 Warmup

### March 2015

# Range Minimum Query

The problem description can be found in . It asks to find the connected blocks which meet the requirements and …

The following includes the solution to the first two problems in MSBoP 2015 Warmup. The third problem seems a maximum …

It’s also a solution to SGU 155. The problem can be viewed here. Every node has two values <k, a>, …

Close Drawer
## Simple Note