QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#218119#6431. Oops, It's Yesterday Twice MoreHurrikale#WA 0ms1424kbC++14521b2023-10-17 18:46:572023-10-17 18:46:57

Judging History

你现在查看的是最新测评结果

  • [2023-10-17 18:46:57]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:1424kb
  • [2023-10-17 18:46:57]
  • 提交

answer

#include<cstdio>
using namespace std;
int N,A,B;
int Tara,Tarb;
int main()
{
    scanf("%d%d%d",&N,&A,&B);
    Tara=(A>(N>>1));
    Tarb=(B>(N>>1));
        for(int i=1;i<N;++i)
        putchar(!Tara?'R':'L');
        for(int i=1;i<N;++i)
        putchar(!Tarb?'D':'U');
    for(int i=(Tara?N:1);i>A;--i)
    putchar('U');
    for(int i=(Tara?N:1);i<A;++i)
    putchar('D');
    for(int i=(Tarb?N:1);i>B;--i)
    putchar('L');
    for(int i=(Tarb?N:1);i<B;++i)
    putchar('R');
    putchar('\n');
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 1424kb

input:

3 3 3

output:

LLUU

result:

wrong answer Failed