QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #83239 | #5574. Julienne the Deck | zhangboju# | WA | 2ms | 3528kb | C++14 | 389b | 2023-03-01 08:53:13 | 2023-03-01 08:53:15 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
x=0;short f=1;char c=getchar();
for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
x*=f;return;
}
const int mod=998244353;
#define ll long long
int main()
{
ll n;read(n);
n%=mod;
printf("%lld\n",2*n%mod);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3528kb
input:
1
output:
2
result:
wrong answer 1st numbers differ - expected: '1', found: '2'