QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#275041 | #7887. How to Identify My Name | supepapupu | AC ✓ | 0ms | 3704kb | C++17 | 661b | 2023-12-04 11:38:10 | 2023-12-04 11:38:11 |
Judging History
answer
#include <bits/stdc++.h>
#define x first
#define y second
#define el '\n'
#define debug(x) cout << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;
void inc(ll &a, ll b) {
a += b;
if (a >= mod) a -= mod;
}
void dec(ll &a, ll b) {
a -= b;
if (a < 0) a += mod;
}
ll add(ll a, ll b) {
a += b;
return a >= mod ? a - mod : a;
}
ll del(ll a, ll b) {
a -= b;
return a < 0 ? a + mod : a;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cout << "BAGIDNJF\n";
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3704kb
input:
<no-input>
output:
BAGIDNJF
result:
ok correct! you answered 8 out of 8 questions correctly
Extra Test:
score: 0
Extra Test Passed