QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#622056 | #6431. Oops, It's Yesterday Twice More | KXDdesu | WA | 0ms | 3648kb | C++23 | 646b | 2024-10-08 19:41:38 | 2024-10-08 19:41:39 |
Judging History
answer
#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define lowbit(x) ((x) & (-x))
using i64 = long long;
using pii = std::pair<int, int>;
void solve()
{
int n, a, b;
std::cin >> n >> a >> b;
int gcd = std::gcd(a, b);
for (int i = 0; i < a; i ++) {
std::cout << "R";
}
for (int i = 0; i < b; i ++) {
std::cout << "D";
}
std::cout << '\n';
}
int main()
{
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::ios::sync_with_stdio(false);
int T = 1;
//std::cin >> T;
while (T --) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
input:
3 3 3
output:
RRRDDD
result:
ok n=3, x=3, y=3
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3648kb
input:
4 3 2
output:
RRRDD
result:
wrong answer Failed