#include <stdio.h>
#define N 10
int main(int argc, char* argv[])
{
int A[N][N] = { { 3, 1, 5, 4, 6, 7, 4, 5, 1, 3 },
{ 4, 7, 6, 2, 9, 9, 2, 6, 7, 4 },
{ 3, 5, 1, 8, 7, 6, 5, 3, 4, 2 },
{ 6, 2, 9, 1, 7, 4, 3, 6, 4, 2 },
{ 2, 8, 9, 1, 4, 3, 5, 6, 7, 2 },
{ 1, 2, 3, 4, 5, 5, 4, 3, 2, 1 },
{ 7, 9, 8, 6, 5, 1, 2, 9, 8, 3 },
{ 8, 9, 1, 3, 2, 2, 3, 1, 9, 8 },
{ 4, 6, 3, 6, 7, 7, 6, 3, 6, 4 },
{ 1, 3, 7, 6, 2, 9, 3, 2, 1, 5 } };
for (int t1 = 0; t1 < N; t1++)
{
for (int t2 = 0; t2 < N; t2++)
printf("%d ",A[t1][t2]);
printf("\n");
}
printf("\npolyndroms = ");
for (int i = 0; i < N; i++)
{
bool found = false;
int k1 = 0, k2 = N-1;
while (k1 < N / 2 && !found)
found = A[i][k1++] != A[i][k2--] ? 1 : 0;
if (!found) printf("%d ", i);
}
printf("\n");
}