QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #396111 | #2852. 为最美的那位献上花朵 | ucup-team1251 | WA | 0ms | 3692kb | C++17 | 386b | 2024-04-22 13:04:47 | 2024-04-22 13:04:48 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
void solve() {
cout << "cherry";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int _;
_ = 1;
//cin >> _;
while (_--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3692kb
input:
output:
cherry
result:
wrong answer