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
|
#include <iostream>
#include <string>
using namespace std;
template<int N>
bool func(string (&Q)[N][N], string s) {
short n_presents[2] = {0};
for(int i = 0; i < N; ++i) {
if(Q[i][i].find(s) != std::string::npos)
n_presents[0]++;
}
for(int i = 0, j = N-1; i < N; ++i, --j) {
cout << Q[j][i].find(s) << endl;
if(Q[j][i].find(s) != std::string::npos)
n_presents[1]++;
}
return n_presents[0] > n_presents[1];
}
int main() {
string a1[3][3] = {
{"ciaoneXX", "fra", "zio"},
{"oh, ma che", "eXXh", "sta cosa?"},
{"greg", "no", "foXXrse"}
};
string a2[3][3] = {
{"ciaoneXX", "fra", "ziYYo"},
{"oh, ma che", "eXXYYh", "sta cosa?"},
{"gregYY", "no", "foXrse"}
};
cout << func(a1, "XX") << ' ' << func(a2, "YY") << endl;
return 0;
}
|
