Pagini recente » Cod sursa (job #138943) | Cod sursa (job #526729) | Cod sursa (job #2987592) | Cod sursa (job #2014394) | Cod sursa (job #2029890)
#include <fstream>
using namespace std;
ifstream fin ("cruce.in");
ofstream fout ("cruce.out");
int n, m, i, j, s, k, l;
char v[102][102];
int main()
{
fin>>n>>m;
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
fin>>v[i][j];
}
}
for(i = 2; i <= n; i++){
for(j = 2; j <= m; j++){
for(k = 2; k <= n; k++){
for(l = 2; l <= m; l++){
if((i + k - 1) <= n && (i - k + 1) >= 1 && (j + l - 1) <= m && (j - l + 1) >= 1){
if((v[i + k - 1][j] == v[i - k + 1][j]) && (v[i][j + l - 1] == v[i][j - l + 1])){
s++;
}
}
else{
break;
}
}
}
}
}
fout<<s;
return 0;
}