QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#48510 | #3995. Terrible Additive Number Theory Problem | paekae# | WA | 3ms | 3620kb | C++ | 841b | 2022-09-14 13:25:57 | 2022-09-14 13:25:59 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
std::mt19937 rng(std::random_device{}());
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef const int& cint;
typedef const ll& cll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
#define ls (loc<<1)
#define rs ((loc<<1)|1)
const int mod = 1e9+7;
const int inf_int = 0x7fffffff;
const int hf_int = 0x3f3f3f3f;
const ll inf_ll = 0x7fffffffffffffff;
const double ept = 1e-9;
bool solve(cint T) {
cout << 0 << '\n';
return true;
}
int main() {
//freopen("1.in", "r", stdin);
//cout.flags(ios::fixed); cout.precision(8);
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int T_=1;
// std::cin >> T_;
for(int _T=1; _T<=T_; _T++) { if(solve(_T) == 0) { break; } }
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 3620kb
input:
100
output:
0
result:
ok 1 number(s): "0"
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3540kb
input:
10000
output:
0
result:
wrong answer 1st numbers differ - expected: '1', found: '0'