萌新求调（样例没过）

#include<bits/stdc++.h>
using namespace std;
inline int read()
{
    register int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
        if(c=='-') f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9')
    {
        x=(x<<3)+(x<<1)+(c^48); 
        c=getchar();
    }
    return x*f;
}
char a[15][15]; 
int n=10,mf=0,mc=0,fx,fy,cx,cy,cnt;
int flag=0;//judge次数 
void judge(int m,int x,int y,bool fc)
{
	flag++;
	if(m==0) 
		if(a[x-1][y]!='*') x--;
		else judge(1,x,y,fc);
	if(m==1)
		if(a[x][y+1]!='*') y++;
		else judge(2,x,y,fc);
	if(m==2)
		if(a[x+1][y]!='*') x++;
		else judge(3,x,y,fc);	
	if(m==3)
		if(a[x][y-1]!='*') y--;
		else judge(0,x,y,fc);	
	if(flag>=5){cout<<"0";exit(0);}
	flag=0;
	if(fc==0)
		fx=x,fy=y,mf=m;
	else cx=x,cy=y,mc=m;
	cout<<fx<<' '<<fy<<' '<<cx<<' '<<cy<<' '<<fc<<endl;
}
void walk()
{
	//farmer
	if(mf==0) judge(0,fx,fy,0);
	if(mf==1) judge(1,fx,fy,0);
	if(mf==2) judge(2,fx,fy,0);
	if(mf==3) judge(3,fx,fy,0); 
	//cow
	if(mc==0) judge(0,cx,cy,1);
	if(mc==1) judge(1,cx,cy,1);
	if(mc==2) judge(2,cx,cy,1);
	if(mc==3) judge(3,cx,cy,1); 
	if(fx==cx && fy==cy){cout<<cnt<<' '<<fx<<' '<<fy<<' '<<cx<<' '<<cy;exit(0);}
}
int main()
{
	memset(a,'.',sizeof(a));
	for(int i=0;i<=n+1;i++) 
		a[0][i]='*',a[i][0]='*',a[i][n+1]='*',a[n+1][i]='*';
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			cin>>a[i][j]; 
			if(a[i][j]=='F') fx=i,fy=j;
			if(a[i][j]=='C') cx=i,cy=j;
		}
	cnt=1;
	while(cnt<=160000)
	{
		walk();
		//cout<<fx<<' '<<fy<<' '<<cx<<' '<<cy<<endl;
		++cnt;
	}
	cout<<0;
	return 0;
}