模拟/usaco 1.2.2 Transformations

题意

　　给出一个n*n的原始矩阵图形，一个n*n的变换后矩阵图形，再给出7种变换法则，问是哪种变换

分析

　　纯模拟，写的我心烦，其实我就该多锻炼锻炼这种题

　　话说翻了一下一年半前刚学编程的程序，当时把这道题看作神题啊，“多麻烦的模拟！”，然后照猫画虎写了个程序，才几十行- -

　　现在..呵呵了 比起有算法的东西 真是简单..不过我还磨叽了二十分钟写了不到200行还贡献了一次WA

　　至于为啥WA？泥煤又是没看清题..注意要输出最小的变换

Accepted Code

无视乱七八糟的输出吧

{
ID: jessiel2
PROG: transform
LANG: PASCAL
}
Program transform;
Const
  Infile = 'transform.in';
  Outfile = 'transform.out';
Type
  arr = Array[0..15,0..15]Of Char;
Var
  i,j,n:Longint;
  a,b,c:Arr;
Function check(b,c:Arr):Boolean;
Var
  i,j:Longint;
Begin
  For i:=1 To n Do Begin
    For j:=1 To n Do
      If c[i,j]<>b[i,j] Then Exit(false);
  End;
  Exit(true);
End;

Function change1(a,c:Arr):Arr;
Var
  i,j:Longint;
Begin
  For i:=1 To n Do Begin
    For j:=1 To n Do c[j,n-i+1]:=a[i,j];
  End;
  Exit(c);
End;
Function change2(a,c:Arr):Arr;
Var
  c1:Arr;
Begin
  c:=change1(a,c);
  c1:=c;
  c1:=change1(c,c1);
  c:=c1;
  Exit(c);
End;
Function change3(a,c:Arr):Arr;
Var
  c1:Arr;
Begin
  c1:=change2(a,c1);
  c:=change1(c1,c);
  Exit(c);
End;

Function change4(a,c:Arr):Arr;
Var
  i,j:Longint;
Begin
  For i:=1 To n Do Begin
    For j:=1 To n Do c[i,j]:=a[i,n-j+1];
  End;
  Exit(c);
End;
Function change51(a,c:Arr):Arr;
Var
  c1:Arr;
Begin
  c1:=change4(a,c1);
  c:=change1(c1,c);
  Exit(c);
End;
Function change52(a,c:Arr):Arr;
Var
  c1:Arr;
Begin
  c1:=change4(a,c1);
  c:=change2(c1,c);
  Exit(c);
End;
Function change53(a,c:Arr):Arr;
Var
  c1:Arr;
Begin
  c1:=change4(a,c1);
  c:=change3(c1,c);
  Exit(c);
End;
Procedure print(c:Arr);
Var
  i,j:Longint;
Begin
  For i:=1 To n Do Begin
    For j:=1 To n Do Write(c[i,j]);
    WriteLn;
  End;
  WriteLn;
End;

Begin
  Assign(input,infile);Reset(Input);
  Assign(output,outfile);Rewrite(output);
  ReadLn(n);
  For i:=1 To n Do Begin
    For j:=1 To n Do Read(a[i,j]);
    ReadLn;
  End;
  For i:=1 To n Do Begin
    For j:=1 To n Do Read(b[i,j]);
    ReadLn;
  End;
  c:=change1(a,c);
  //print(c);

  If check(b,c) Then Begin
    WriteLn(1);
    Close(input);Close(output);
    halt;
  End;

  c:=change2(a,c);
  //print(c);

  If check(b,c) Then Begin
    WriteLn(2);
    Close(input);Close(output);
    halt;
  End;

  c:=change3(a,c);
  //print(c);

  If check(b,c) Then Begin
    WriteLn(3);
    Close(input);Close(output);
    halt;
  End;

  c:=change4(a,c);
  //print(c);

  If check(b,c) Then Begin
    WriteLn(4);
    Close(input);Close(output);
    halt;
  End;

  c:=change51(a,c);
  If check(b,c) Then Begin
    WriteLn(5);
    Close(input);Close(output);
    halt;
  End;
  c:=change52(a,c);
  If check(b,c) Then Begin
    WriteLn(5);
    Close(input);Close(output);
    halt;
  End;
  c:=change53(a,c);
  If check(b,c) Then Begin
    WriteLn(5);
    Close(input);Close(output);
    halt;
  End;
  If check(a,b) Then Begin
    WriteLn(6);
    Close(input);Close(output);
    halt;
  end;
  WriteLn(7);
  Close(input);Close(output);
End.