-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTransformations.c
More file actions
127 lines (122 loc) · 1.94 KB
/
Transformations.c
File metadata and controls
127 lines (122 loc) · 1.94 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/*
ID: sunheco1
LANG: C
TASK: transform
*/
#include<stdio.h>
char ori[11][11],tar[11][11],map1[11][11],map2[11][11],map3[11][11],map4[11][11],map5[11][11],map6[11][11],map7[11][11],map8[11][11];
char temp[11];
int n;
int Equal(char (*a)[11],char (*b)[11])
{
char *tar1,*tar2;
int i,j;
for(i=1;i<=n;i++)
{
tar1=(char *)(a+i);
tar2=(char *)(b+i);
for(j=1;j<=n;j++)
{
if(tar1[j]!=tar2[j])
return 0;
}
}
return 1;
}
int main()
{
int total,i,j,k,l;
FILE *fin = fopen ("transform.in", "r");
FILE *fout = fopen ("transform.out", "w");
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(fin,"%s",&ori[i][1]);
}
for(i=1;i<=n;i++)
{
fscanf(fin,"%s",&tar[i][1]);
}
for(i=1,k=n;i<=n;i++,k--)
{
for(j=1;j<=n;j++)
map1[j][k]=ori[i][j];
}
if(Equal(map1,tar))
{
fprintf(fout,"1\n");
return 0;
}
for(i=1,k=n;i<=n;i++,k--)
{
for(j=1,l=n;j<=n;j++,l--)
map2[k][l]=ori[i][j];
}
if(Equal(map2,tar))
{
fprintf(fout,"2\n");
return 0;
}
for(i=1;i<=n;i++)
{
for(j=1,k=n;j<=n;j++,k--)
map3[k][i]=ori[i][j];
}
if(Equal(map3,tar))
{
fprintf(fout,"3\n");
return 0;
}
for(i=1;i<=n;i++)
{
for(j=1,k=n;j<=n;j++,k--)
map4[i][k]=ori[i][j];
}
if(Equal(map4,tar))
{
fprintf(fout,"4\n");
return 0;
}
for(i=1,k=n;i<=n;i++,k--)
{
for(j=1;j<=n;j++)
map5[j][k]=map4[i][j];
}
if(Equal(map5,tar))
{
fprintf(fout,"5\n");
return 0;
}
for(i=1,k=n;i<=n;i++,k--)
{
for(j=1,l=n;j<=n;j++,l--)
map6[k][l]=map4[i][j];
}
if(Equal(map6,tar))
{
fprintf(fout,"5\n");
return 0;
}
for(i=1;i<=n;i++)
{
for(j=1,k=n;j<=n;j++,k--)
map7[k][i]=map4[i][j];
}
if(Equal(map7,tar))
{
fprintf(fout,"5\n");
return 0;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
map8[i][j]=ori[i][j];
}
if(Equal(map8,tar))
{
fprintf(fout,"6\n");
return 0;
}
fprintf(fout,"7\n");
return 0;
}