-
Notifications
You must be signed in to change notification settings - Fork 0
/
10855.cpp
140 lines (130 loc) · 2.68 KB
/
10855.cpp
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
128
129
130
131
132
133
134
135
136
137
138
139
140
#include<iostream>
using namespace std;
int main()
{
long int m,n;
while(true)
{
cin>>m>>n;
int c0=0,c1=0,c2=0,c3=0;
if(m==0 || n==0)return 0;
char a[m][m],b[n][n];
for(int i=0;i<m;i++)
for(int j=0;j<m;j++)
cin>>a[i][j];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>b[i][j];
for(int i=0;i<=m-n;i++)
{
for(int j=0;j<=m-n;j++)
{
if(a[i][j]==b[0][0] && a[i][j+n-1]==b[0][n-1] && a[i+n-1][j]==b[n-1][0] && a[i+n-1][j+n-1]==b[n-1][n-1])
{
int f=1;
for(int l=0;l<n;l++)
{
for(int h=0;h<n;h++)
{
if(a[i+l][j+h]!=b[l][h]){f=0;break;}
}
if(f==0)break;
}
if(f==1)c0++;
}
}
}
for (int i = 0; i < n/ 2; i++)
{
for (int j = i; j < n - i - 1; j++)
{
char te=b[i][j];
b[i][j] = b[n - 1 - j][i];
b[n - 1 - j][i] = b[n - 1 - i][n - 1 - j];
b[n - 1 - i][n - 1 - j] = b[j][n - 1 - i];
b[j][n - 1 - i] = te;
}
}
for(int i=0;i<=m-n;i++)
{
for(int j=0;j<=m-n;j++)
{
if(a[i][j]==b[0][0] && a[i][j+n-1]==b[0][n-1] && a[i+n-1][j]==b[n-1][0] && a[i+n-1][j+n-1]==b[n-1][n-1])
{
int f=1;
for(int l=0;l<n;l++)
{
for(int h=0;h<n;h++)
{
if(a[i+l][j+h]!=b[l][h]){f=0;break;}
}
if(f==0)break;
}
if(f==1)c1++;
}
}
}
for (int i = 0; i < n/ 2; i++)
{
for (int j = i; j < n - i - 1; j++)
{
char te=b[i][j];
b[i][j] = b[n - 1 - j][i];
b[n - 1 - j][i] = b[n - 1 - i][n - 1 - j];
b[n - 1 - i][n - 1 - j] = b[j][n - 1 - i];
b[j][n - 1 - i] = te;
}
}
for(int i=0;i<=m-n;i++)
{
for(int j=0;j<=m-n;j++)
{
if(a[i][j]==b[0][0] && a[i][j+n-1]==b[0][n-1] && a[i+n-1][j]==b[n-1][0] && a[i+n-1][j+n-1]==b[n-1][n-1])
{
int f=1;
for(int l=0;l<n;l++)
{
for(int h=0;h<n;h++)
{
if(a[i+l][j+h]!=b[l][h]){f=0;break;}
}
if(f==0)break;
}
if(f==1)c2++;
}
}
}
for (int i = 0; i < n/ 2; i++)
{
for (int j = i; j < n - i - 1; j++)
{
char te=b[i][j];
b[i][j] = b[n - 1 - j][i];
b[n - 1 - j][i] = b[n - 1 - i][n - 1 - j];
b[n - 1 - i][n - 1 - j] = b[j][n - 1 - i];
b[j][n - 1 - i] = te;
}
}
for(int i=0;i<=m-n;i++)
{
for(int j=0;j<=m-n;j++)
{
if(a[i][j]==b[0][0] && a[i][j+n-1]==b[0][n-1] && a[i+n-1][j]==b[n-1][0] && a[i+n-1][j+n-1]==b[n-1][n-1])
{
int f=1;
for(int l=0;l<n;l++)
{
for(int h=0;h<n;h++)
{
if(a[i+l][j+h]!=b[l][h]){f=0;break;}
}
if(f==0)break;
}
if(f==1)c3++;
}
}
}
cout<<c0<<" "<<c1<<" "<<c2<<" "<<c3<<"\n";
}
return 0;
}