#include"stdafx.h"
#include<iostream>
#include<vector>
using namespace std;
struct point {
int x, y;
};
vector<vector<point> > ans;
void search(point begin, point end, vector<point> temp) {
if (begin.x == end.x&&begin.y == end.y) {
ans.push_back(temp);
return;
}
if (begin.x + 1 <= end.x) {
vector<point> t2(temp);
begin.x++;
t2.push_back(begin);
search(begin, end, t2);
begin.x--;
}
if (begin.y + 1 <= end.y) {
vector<point> t2(temp);
begin.y++;
t2.push_back(begin);
search(begin, end, t2);
begin.y--;
}
}
int main()
{
int xx, yy;
cin >> xx>>yy;
point end;
end.x = xx;
end.y = yy;
point begin;
begin.x = 0;
begin.y = 0;
vector<point> temp;
temp.push_back(begin);
search(begin, end, temp);
for (int i = 0; i<ans.size(); i++) {
for (int j = 0; j<ans[i].size(); j++) {
j != ans[i].size() - 1 ? cout << "(" << ans[i][j].x << "," << ans[i][j].y << ")" << "->" : cout << "(" << ans[i][j].x << "," << ans[i][j].y << ")" << endl;
}
}
while (1);
}
从原点走到(x,y)的所有路径,只能向上和向右走
最新推荐文章于 2022-06-21 10:02:02 发布