玄学输出注意下

#include<cstdio>
#define tin int
#define itn int
#define tni int
#define nit int
#define nti int
#define pritnf printf
#define scnaf scanf
#define retrun return
#define sizoef sizeof
#define ll long long
#define inl inline
#define br break
#define con continue
#define mst(a,b) memset(a,b,sizeof(a))
#define fora(x,a,b) for(re tin x=a;x<=b;++x)
#define forb(x,a,b) for(re itn x=a;x>=b;--x)
#define re register
#define str struct
#define infa 0x3f3f3f3f
#define infb 0x7fffffff
#define infc 1061109567
#define infd 0x7f
using namespace std;
#define maxa 24
#define maxb 70004
#include<cstring>
#include<iostream>

ll maxx=0,n,h[maxa]={0},r,ans[maxb][maxa],mi[]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072};

tin main()
{
	mst(ans,0);
	scanf("%lld%lld",&n,&r);
	fora(i,1,n)
	{
		scanf("%d",&h[i]);
	}
	fora(i,1,n)
	{
		ans[1<<(i-1)][i]=1;
	}
	////
	fora(i,0,mi[n])
	{
		fora(j,1,n)
		{
			if(!(i&1<<(j-1)))
			{
				con;
			}
			fora(k,1,n)
			{
				if(max(j,k)-min(j,k)>r)
				{
					ans[i][j]+=ans[i-(1<<(j-1))][k];
				}
			}
		}
	}
	//
	fora(i,1,n)
	{
		maxx+=ans[(1<<n)-1][i];
	}
	printf("%lld\n",maxx);
	return 0;
}