{
/* allocatemem(32000000);*/ 
p=2;
q=2;
k0=2;   	/* initial weight */
m9=300;		/* number of weights */
d0=1;		/* weight step */
print("[q="q"]");
for(k=k0,k0+m9-1,print1(k"--- ");
U=matrix(k-1,k-1,j,l,if(l==j, (-t)^(j-1)*(binomial(k-2-(j-1),(j-1))%p),
-(t^(j-1))*(
	if((l-j)%(q-1)==0 && l<j,binomial(k-2-(l-1),j-l)%p,0)+
	if((l-j)%(q-1)==0,(-1)^(j)*(binomial(k-2-(l-1),(j-1))%p),0)
	)
));
f=charpoly(U);
P=vector(k,j,polcoeff(f,j-1,x));
D=vector(k,j,poldegree(P[j]));
Q=vector(k,j,
	r=-1;
	for(l=0,D[j],
		b=polcoeff(P[j],l,t);
		if(b%p==0,,r=if(r<0,l,min(r,l)))
			
	);
	r
);


/* slope computation */


m=vecmax(Q);
if(m<0,print("F: "k-1);return);

for(j=1,k-1,
	r=-1;s=0;
	if(Q[k+1-j]<>-1,
		for(l=j+1,k,
			if(Q[k+1-l]==-1,,
			z=(Q[k+1-j]-Q[k+1-l])/(j-l);
			if((r==-1)||(r*(l-j)+Q[k+1-j]>=Q[k+1-l]),r=z;s=l);
			)
		));
	if(r>=0,print1(r ":" s-j ", ");j=s-1;w=s)
);
if(w<k,print1("F:"k-w));
print();
k=k+(d0-1);)
}