#include <stdarg.h>
#include "tree-vect.h"
#define N 32
struct t{
int k[N];
int l;
};
struct s{
char a;
char b[N-1];
char c[N];
struct t d;
struct t e;
};
int main1 ()
{
int i;
struct s tmp;
for (i = 0; i < N/2; i++)
{
tmp.b[i] = 5;
}
for (i = 0; i <N/2; i++)
{
if (tmp.b[i] != 5)
abort ();
}
for (i = 0; i < N/2; i++)
{
tmp.c[i] = 6;
}
for (i = 0; i <N/2; i++)
{
if (tmp.c[i] != 6)
abort ();
}
for (i = 0; i < N/2; i++)
{
tmp.d.k[i] = 7;
}
for (i = 0; i <N/2; i++)
{
if (tmp.d.k[i] != 7)
abort ();
}
for (i = 0; i < N/2; i++)
{
tmp.e.k[i] = 8;
}
for (i = 0; i <N/2; i++)
{
if (tmp.e.k[i] != 8)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}