QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#48513 | #3995. Terrible Additive Number Theory Problem | paekae# | AC ✓ | 3ms | 3688kb | C++ | 912b | 2022-09-14 14:05:57 | 2022-09-14 14:06:00 |
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;
ll n;
bool solve(cint T) {
cin >> n;
if(n >= 2431) { cout << 1 << '\n'; }
else { 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;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3528kb
input:
100
output:
0
result:
ok 1 number(s): "0"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
10000
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
1767
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
9876
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 3ms
memory: 3688kb
input:
1800
output:
0
result:
ok 1 number(s): "0"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3688kb
input:
9540
output:
1
result:
ok 1 number(s): "1"
Test #7:
score: 0
Accepted
time: 3ms
memory: 3536kb
input:
1926
output:
0
result:
ok 1 number(s): "0"
Test #8:
score: 0
Accepted
time: 3ms
memory: 3620kb
input:
8426
output:
1
result:
ok 1 number(s): "1"
Test #9:
score: 0
Accepted
time: 3ms
memory: 3636kb
input:
2022
output:
0
result:
ok 1 number(s): "0"
Test #10:
score: 0
Accepted
time: 2ms
memory: 3528kb
input:
7826
output:
1
result:
ok 1 number(s): "1"
Test #11:
score: 0
Accepted
time: 2ms
memory: 3536kb
input:
1000000000000000000
output:
1
result:
ok 1 number(s): "1"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
284398329857324927
output:
1
result:
ok 1 number(s): "1"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
928473658274163764
output:
1
result:
ok 1 number(s): "1"
Test #14:
score: 0
Accepted
time: 3ms
memory: 3612kb
input:
2435
output:
1
result:
ok 1 number(s): "1"
Test #15:
score: 0
Accepted
time: 3ms
memory: 3632kb
input:
2430
output:
0
result:
ok 1 number(s): "0"
Test #16:
score: 0
Accepted
time: 3ms
memory: 3688kb
input:
2425
output:
0
result:
ok 1 number(s): "0"
Test #17:
score: 0
Accepted
time: 3ms
memory: 3524kb
input:
2431
output:
1
result:
ok 1 number(s): "1"
Test #18:
score: 0
Accepted
time: 3ms
memory: 3536kb
input:
2432
output:
1
result:
ok 1 number(s): "1"
Test #19:
score: 0
Accepted
time: 3ms
memory: 3636kb
input:
1
output:
0
result:
ok 1 number(s): "0"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
12349723982598
output:
1
result:
ok 1 number(s): "1"