int binary_search(int t[], int n, int e)
{
	int l=0, u=n;

	while (l+1<u)
	{
		int m=(l+u)/2;
		if (t[m]<e) l=m; else u=m;
	}
	if (t[u]==e) return u;
	else return 0;
}