QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#692987#6431. Oops, It's Yesterday Twice MorenageingWA 0ms3632kbC++20529b2024-10-31 15:19:582024-10-31 15:20:03

Judging History

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

  • [2024-10-31 15:20:03]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3632kb
  • [2024-10-31 15:19:58]
  • 提交

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;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3 3 3

output:

ULULDDRR

result:

wrong answer Too long.