Kangaroo Puzzle Gym - 101981K

https://cn.vjudge.net/problem/Gym-101981K 

思路：地图很小；步数很多，而一旦两个同一处，因为同时移动所以下次都是位置相同； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    string s="UDLR";
    string ans="";
    for(int i=0;i<50000;i++)
    {
        int id=rand()%4;
        ans+=s[id];
    }
    cout<<ans<<endl;

    return 0;
}