青蛙跳河

# include
# include
int a[100]={0},b[100]={0},sum=0,k=25;//a[]横坐标，b[]纵坐标
int check(int n){
	int i;
	if((a[n]-a[n-1]==0&&abs(b[n]-b[n-1])==1)||(b[n]-b[n-1]==0&&abs(a[n]-a[n-1])==1)){
	if(b[n]==2&&a[n]!=2) return 0;
	for(i=0;i