#include <stdarg.h>
#include "tree-vect.h"
#define N 32
struct s{
int m;
int n[N][N][N];
};
struct test1{
struct s a;
int b;
int c;
struct s e;
};
int main1 ()
{
int i,j;
struct test1 tmp1;
for (i = 0; i < N; i++)
{
tmp1.a.n[1][2][i] = 5;
}
for (i = 0; i <N; i++)
{
if (tmp1.a.n[1][2][i] != 5)
abort ();
}
for (i = 3; i < N-1; i++)
{
tmp1.a.n[1][2][i] = 6;
}
for (i = 3; i < N-1; i++)
{
if (tmp1.a.n[1][2][i] != 6)
abort ();
}
for (i = 0; i < N; i++)
{
tmp1.e.n[1][2][i] = 7;
}
for (i = 0; i < N; i++)
{
if (tmp1.e.n[1][2][i] != 7)
abort ();
}
for (i = 3; i < N-3; i++)
{
tmp1.e.n[1][2][i] = 8;
}
for (i = 3; i <N-3; i++)
{
if (tmp1.e.n[1][2][i] != 8)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}