QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #81805 | #5574. Julienne the Deck | whatever# | WA | 2ms | 3404kb | C++14 | 369b | 2023-02-26 13:39:21 | 2023-02-26 13:39:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int mod = 998244353;
ll n;
int main() {
#ifdef ALEX_WEI
FILE* IN = freopen("1.in", "r", stdin);
FILE* OUT = freopen("1.out", "w", stdout);
#endif
cin >> n;
cout << (n < 3 ? n : n * 2) % mod << "\n";
return 0;
}
/*
g++ I.cpp -o I -std=c++14 -O2 -DALEX_WEI
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3404kb
input:
1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3364kb
input:
1000000000000
output:
516560941
result:
ok 1 number(s): "516560941"
Test #3:
score: 0
Accepted
time: 2ms
memory: 3372kb
input:
3
output:
6
result:
ok 1 number(s): "6"
Test #4:
score: 0
Accepted
time: 2ms
memory: 3360kb
input:
4
output:
8
result:
ok 1 number(s): "8"
Test #5:
score: -100
Wrong Answer
time: 2ms
memory: 3364kb
input:
2
output:
2
result:
wrong answer 1st numbers differ - expected: '1', found: '2'