QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#692987 | #6431. Oops, It's Yesterday Twice More | nageing | WA | 0ms | 3632kb | C++20 | 529b | 2024-10-31 15:19:58 | 2024-10-31 15:20:03 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const int N = 2E5 + 10, mod = 1E9 + 7;
void solve() {
int n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n - 1; i ++) {
cout << "UL";
}
for (int i = 0; i < a - 1; i ++) {
cout << "D";
}
for (int i = 0; i < b - 1; i ++) {
cout << "R";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t --) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3632kb
input:
3 3 3
output:
ULULDDRR
result:
wrong answer Too long.