QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#684641 | #6431. Oops, It's Yesterday Twice More | catch-up-from-behind# | WA | 0ms | 3656kb | C++17 | 602b | 2024-10-28 14:55:16 | 2024-10-28 14:55:17 |
Judging History
answer
// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
ll xx = 0, f = 1; char ch = getchar();
for (;!isdigit(ch); ch = getchar())f = (ch == '-' ? -1 : 1);
for (; isdigit(ch); ch = getchar())xx = (xx << 3) + (xx << 1) + ch - '0';
return xx * f;
}
signed main(){
int n = read(), a = read(), b = read();
for (int i = 1; i < n; ++i)printf("L");
for (int i = 1; i < n; ++i)printf("U");
for (int i = 1; i < a; ++i)printf("R");
for (int i = 1; i < b; ++i)printf("D");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3656kb
input:
3 3 3
output:
LLUURRDD
result:
wrong answer Too long.