cf 3a Shortest path of the king

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
    char c1,c2;
    int x1,x2;
    cin>>c1>>x1>>c2>>x2;
    int a=c2-c1,b=x2-x1;
    int ans=max(abs(a),abs(b));
    printf("%d\n",ans);
    while(a!=0||b!=0)
    {
        if(a>0)
        {
            printf("R");
            a--;
        }
        else if(a<0)
        {
            printf("L");
            a++;
        }
        if(b<0)
        {
            printf("D");
            b++;
        }
        else if(b>0)
        {
            printf("U");
            b--;
        }
        printf("\n");
    }
    return 0;
}