QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#250678 | #6431. Oops, It's Yesterday Twice More | hhoppitree# | WA | 0ms | 3876kb | C++14 | 591b | 2023-11-13 15:37:37 | 2023-11-13 15:37:38 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
signed main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[i] < a[j]) {
swap(a[i], a[j]);
++a[0];
}
}
printf("%d: ", a[0]);
for (int j = 1; j <= n; ++j) {
printf("%d%c", a[j], " \n"[j == n]);
}
}
printf("%d\n", a[0]);
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3876kb
input:
3 3 3
output:
0: 3 3 0 0: 3 3 0 1: 0 3 3 1
result:
wrong answer Line "0: 3 3 0" doesn't correspond to pattern "[UDLR]{0,1500}"