QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #761418 | #9579. 比分幻术 | wlkmok369 | WA | 0ms | 3572kb | C++14 | 616b | 2024-11-18 22:46:18 | 2024-11-18 22:46:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define PII pair<ll, ll>
const ll mod = 1e9 + 7;
const ll MAXN = 500005;
const ll base1 = 131;
const ll base2 = 127;
ll _ = 1, n, m, ans = 0, a[MAXN], f[MAXN];
void solve()
{
string s;
cin >> s;
ll s1 = s[0] - '0';
ll s2 = s[2] - '0';
if (s1 >= s2)
{
cout << s1 << '-' << s2 << '\n';
}
else
{
cout << s2 << '-' << s1 << '\n';
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
// cin>>_;
while (_--)
{
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
input:
2-3
output:
3-2
result:
ok single line: '3-2'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3508kb
input:
8-1
output:
8-1
result:
wrong answer 1st lines differ - expected: '1-8', found: '8-1'