QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #372547 | #5574. Julienne the Deck | flying# | WA | 1ms | 3860kb | C++14 | 232b | 2024-03-31 15:18:05 | 2024-03-31 15:18:06 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int Mod=998244353;
int main()
{
long long n;
cin >> n;
if(n==1)
printf("1\n");
else if(n==2)
printf("2\n");
else
printf("%lld\n",n*2%Mod);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3724kb
input:
1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
1000000000000
output:
516560941
result:
ok 1 number(s): "516560941"
Test #3:
score: 0
Accepted
time: 1ms
memory: 3832kb
input:
3
output:
6
result:
ok 1 number(s): "6"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3860kb
input:
4
output:
8
result:
ok 1 number(s): "8"
Test #5:
score: -100
Wrong Answer
time: 1ms
memory: 3664kb
input:
2
output:
2
result:
wrong answer 1st numbers differ - expected: '1', found: '2'