USACO section1.2 Transformations
摘要:
模拟题,给出一个 n×n 的字符块的两个状态(分别为初始态和目标态)和几种操作,问目标态最少是由初始态的哪个操作完成的,WA 3 次。/*PROG: transformLANG: C++*/# include <cstdio># include <cstring># define N 10 + 5void print(char s[][N], int n){ for (int i = 0; i < n; ++i) puts(s[i]);}/* rotate 90 degrees clockwise */void rotate(char s[][N], i 阅读全文
posted @ 2012-07-17 21:37 getgoing 阅读(157) 评论(0) 推荐(0) 编辑