dfs POJ 3717 移动路线

#include<iostream>
using namespace std;

int m, n;
int count = 0;

void dfs(int , int);

int main()
{
//freopen("C:\\Users\\Haojian\\Desktop\\test.txt", "r", stdin);
while (cin >> m >> n)
{
count = 0;
dfs(0,0);
cout << count << endl;
}
return 0;
}

void dfs (int x, int y)
{
if (x == m-1 && y == n-1)
{
count++;
return;
}
else
{

if (x+1 < m && y < n)
dfs(x+1, y);

if (x < m && y + 1 < n)
dfs(x, y+1);
}

}