Transform解题报告

题目摘要:A square pattern of size N x N (1<= N <= 10) black and white square tiles is transformed into anothersquare pattern. Write a program that will recognize the minimum transformationthat has been applied to the original pattern given the following list ofpossible transformations:

#1: 90 Degree Rotation: The pattern wasrotated clockwise 90 degrees.

#2: 180 Degree Rotation: The pattern wasrotated clockwise 180 degrees.

#3: 270 Degree Rotation: The pattern wasrotated clockwise 270 degrees.

#4: Reflection: The pattern was reflectedhorizontally (turned into a mirror image of itself by reflecting around avertical line in the middle of the image).

#5: Combination: The pattern was reflectedhorizontally and then subjected to one of the rotations (#1-#3).

#6: No Change: The original pattern was notchanged.

#7: Invalid Transformation: The new patternwas not obtained by any of the above methods.

In the case that more than one transformcould have been used, choose the one with the minimum number above.

题目大意:一块N x N(1<=N<=10)正方形的黑白瓦片的图案要被转换成新的正方形图案。写一个程序来找出将原始图案按照以下列转换方法转换成新图案的最小方式:

1:转90度:图案按顺时针转90度。

2:转180度:图案按顺时

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值