usaco Transform
来源:互联网 发布:javascript效果源代码 编辑:程序博客网 时间:2024/05/16 12:10
/*ID:usaco_t2LANG:C++TASK:transform*/#include<stdio.h>char a[11][11],b[11][11],fz[11][11],fz1[11][11],fz2[11][11],ff[11][11];int n,i,j,ans=0; void f7(){ printf("7\n");}void f6(){ for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(a[i][j]!=b[i][j]){f7();return;} printf("6\n");}void f5(){ for(i=1;i<=n;i++) for(j=1;j<=n;j++)fz[i][j]=a[i][n-j+1]; for(i=1;i<=n;i++) for(j=1;j<=n;j++) ff[j][n-i+1]=fz[i][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(ff[i][j]!=b[i][j])ans=1; if(ans==0){printf("5\n");return;}ans=0; for(i=1;i<=n;i++) for(j=1;j<=n;j++)fz1[i][j]=fz[n-i+1][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)ff[i][j]=fz1[i][n-j+1]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(ff[i][j]!=b[i][j])ans=1; if(ans==0){printf("5\n");return;}ans=0; for(i=1;i<=n;i++) for(j=1;j<=n;j++)fz1[j][n-i+1]=fz[i][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)fz2[i][j]=fz1[n-i+1][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)ff[i][j]=fz2[i][n-j+1]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(ff[i][j]!=b[i][j])ans=1; if(ans==0){printf("5\n");return;}f6();}void f4(){ for(i=1;i<=n;i++) for(j=1;j<=n;j++)ff[i][j]=a[i][n-j+1]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(ff[i][j]!=b[i][j]){f5();return;} printf("4\n");}void f3(){ for(i=1;i<=n;i++) for(j=1;j<=n;j++)fz[j][n-i+1]=a[i][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)fz1[i][j]=fz[n-i+1][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)ff[i][j]=fz1[i][n-j+1]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(ff[i][j]!=b[i][j]){f4();return;} printf("3\n");}void f2(){ for(i=1;i<=n;i++) for(j=1;j<=n;j++)fz[i][j]=a[n-i+1][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)ff[i][j]=fz[i][n-j+1]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(ff[i][j]!=b[i][j]){f3();return;} printf("2\n");}void f1(){ for(i=1;i<=n;i++) for(j=1;j<=n;j++) ff[j][n-i+1]=a[i][j]; for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(ff[i][j]!=b[i][j]){f2();return;} printf("1\n");}int main(){ int m,i,j,l,k,x,y; freopen("transform.in","r",stdin); freopen("transform.out","w",stdout); scanf("%d%c",&n,&a[1][1]);for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(j==n)scanf("%c%c",&a[i][j],&a[i][j+1]);else scanf("%c",&a[i][j]);for(i=1;i<=n;i++) for(j=1;j<=n;j++)if(j==n)scanf("%c%c",&b[i][j],&b[i][j+1]);else scanf("%c",&b[i][j]); f1(); return 0;}
0 0
- usaco-transform
- USACO transform
- 【USACO】transform
- usaco Transform
- usaco transform
- usaco transform
- usaco——transform
- USACO解析Transform篇
- USACO 1.2 transform
- USACO 1.2 Transformations (transform)
- usaco 1.2.2 transform
- USACO 1.2 transform
- USACO 1.2 transform
- USACO-section1.2.2 transform
- USACO transform
- USACO 1.2.2 Transformations(transform)
- USACO-Section1.2 transform[枚举]
- usaco/ 1.2 milk2/transform/namenum/palsquare/dualpal
- Writing and Optimizing ARM Assembly Code 《ARM...》Chapter-6
- java注解处理器(运行时和编译时处理的注解)
- Android 中 startActivityForResult和setResult详解
- ReactNative之 JSPatch 实现原理详解
- JavaScript Web云平台OS.js介绍
- usaco Transform
- HornetQException[errorType=SECURITY_EXCEPTION message=HQ119031: Unable to validate user: null]
- 端口占用查找
- nginx 负载均衡
- bootstrap 中popover的鼠标悬停下拉菜单效果
- CheckBox影响ListView的OnItemClick点击事件的解决方法
- ggplot2画分面图
- 面向对象(二)
- UVA10003 - Cutting Sticks