i need complete program for following problem

[canny kanna]

Problem : Starting in the bottom left corner of a n×n grid, print all the paths to the bottom right
corner. Paths should follow following rules-
1. You can only move to right or up direction.
2. First move has to be in right direction.
3. You can not cross diagonal.
Sample Input: n = 3
Sample Output:
RRRUUU
RRURUU
RRUURU
RURRUU
RURURU

[Meirambek Zhaparov]

You must write recursion function.
like
go (int x, int y)
{
if (x>n && y>n) exit;
else
{

your code

}


}

[canny kanna]

can U please give the complete code

[firedraco]

No.