QOJ.ac

QOJ

IDSubmission IDProblemHackerOwnerResultSubmit timeJudge time
#1129#239536#8981. Kangaroo PuzzlequailtyKhyalLinFailed.2024-11-05 18:07:162024-11-05 18:07:17

Details

Extra Test:

Accepted
time: 1ms
memory: 3692kb

input:

20 20
11111101111101110111
10010011010011011001
10110110110110110111
01101101101101101101
11011011011011011011
10110110110110110110
11101101101101101101
10011011011011011001
10110110110110110111
01101101101101101101
11011011011011011001
10110110110110110111
11101101101101101100
10011011011011011010
...

output:

DDRDDRUUUDUDUDLURDLRDDLUURRRDDLULUDRRRRRLRDLLRLUDRRULUULRUULDLLRDURLRDLUDRDRDRUUDRLRULURLULUDDRUDDLLLDDRLUDURDUDDLLDRDLUDDUULUURDDLRURDDRLDDRDULUDRRULRDRURUURUDLLDDUUURLDLLUDDUUDRURRDDRLRRLRLDURUUUURLDUDRDLRDRRDDDLULDRURDLDDLDDLRLDLDLUUDURLRLRLDRDLRDULRDUULDLUUULDLDDRDLULRRDLDUDLDRRLLRDDLRDLRURUDDRU...

result:

ok AC

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#239536#8981. Kangaroo PuzzleKhyalLinWA 1ms3684kbC++14229b2023-11-04 21:09:452024-11-05 18:07:55

answer

#include <iostream>
#include <cstdlib>

using namespace std;

int main(void)
{
    char s[] = { 'U', 'L', 'D', 'R' };
    srand(rand());
    for (int i = 0; i < 5e4; i++)
        cout << s[rand() % 4];
    return 0;
}