UVa 10952. Pattern Transformations

Description Consider the two patterns of ‘O’ and ‘X’ below (‘.’ represent an empty square). We want the first pattern to be transformed into the second pattern in one time unit. During this time unit, each symbol (‘O’ and ‘X’) can move one step in any of the four directions (or remain at its current square). All movements happen simultaneously, so a symbol can move to an occupied square, if that symbol is moved to some other square. If a symbol moves from square A to B, and the symbol at B moves to A, we have a swap. Write a program which calculates the least number of swaps needed to transform a given pattern into another given pattern.

UVa 103. Stacking Boxes

Description 在數學或電腦科學裡,有些概念在一維或二維時還蠻簡單的,但到 N 維就會顯得非常複雜。試想一個 n 維的「盒子」:在二維空間裡,盒子 ( 2 , 3 ) 可代表一個長為 2 個單位,寬為 3 個單位的盒子;在三維空間裡,盒子 ( 4 , 8 , 9 ) 則是一個 4*8*9(長、寬、高)的盒子。至於在六維空間裡,也許我們不清楚 ( 4 , 5 , 6 , 7 , 8 , 9 ) 長得怎樣,不過我們還是可以分析這些盒子的特性。

Arch Linux Installation Guide

Archlinux 簡易安裝教學