QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #32271 | #3995. Terrible Additive Number Theory Problem | DaBenZhongXiaSongKuaiDi# | AC ✓ | 3ms | 3732kb | C++14 | 852b | 2022-05-18 16:07:57 | 2022-05-18 16:07:57 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;/*
const int N=5e8+100;
bitset <N> s;
int p[70000000],cnt;*/
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if(n>=11*13*17) cout << 1;
else cout << 0;
/* for(int i=2;i<=N;i++)
{
if(!s[i])
{
if((long long)i*i<=N)for(int j=i+i;j<=N;j+=i)
s[j]=1;
p[++cnt]=i;
}
}
cout << cnt
for(int len=2;len<=20;len++)
{
for(int i=1;i+len-1<=cnt;i++)
{
long long l=i,r=i+len-1,P=1,flag=0;
for(int j=l;j<=r;j++)
{
if(P*(double)p[j]>2e18)
{
flag=1;
break;
}
P=P*p[j];
}
if(flag) break;
++P;
while(P%2==0) P/=2;
if(P==p[r+1])
{
for(int j=l;j<=r;j++)
cout << p[j] << " ";
cout << " " << p[r+1] << "\n";
}
}
}*/
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 3532kb
input:
100
output:
0
result:
ok 1 number(s): "0"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
10000
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 3ms
memory: 3652kb
input:
1767
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: 0
Accepted
time: 2ms
memory: 3460kb
input:
9876
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 3ms
memory: 3548kb
input:
1800
output:
0
result:
ok 1 number(s): "0"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
9540
output:
1
result:
ok 1 number(s): "1"
Test #7:
score: 0
Accepted
time: 2ms
memory: 3728kb
input:
1926
output:
0
result:
ok 1 number(s): "0"
Test #8:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
8426
output:
1
result:
ok 1 number(s): "1"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
2022
output:
0
result:
ok 1 number(s): "0"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
7826
output:
1
result:
ok 1 number(s): "1"
Test #11:
score: 0
Accepted
time: 3ms
memory: 3600kb
input:
1000000000000000000
output:
1
result:
ok 1 number(s): "1"
Test #12:
score: 0
Accepted
time: 3ms
memory: 3576kb
input:
284398329857324927
output:
1
result:
ok 1 number(s): "1"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
928473658274163764
output:
1
result:
ok 1 number(s): "1"
Test #14:
score: 0
Accepted
time: 2ms
memory: 3604kb
input:
2435
output:
1
result:
ok 1 number(s): "1"
Test #15:
score: 0
Accepted
time: 2ms
memory: 3464kb
input:
2430
output:
0
result:
ok 1 number(s): "0"
Test #16:
score: 0
Accepted
time: 2ms
memory: 3572kb
input:
2425
output:
0
result:
ok 1 number(s): "0"
Test #17:
score: 0
Accepted
time: 2ms
memory: 3548kb
input:
2431
output:
1
result:
ok 1 number(s): "1"
Test #18:
score: 0
Accepted
time: 2ms
memory: 3660kb
input:
2432
output:
1
result:
ok 1 number(s): "1"
Test #19:
score: 0
Accepted
time: 2ms
memory: 3532kb
input:
1
output:
0
result:
ok 1 number(s): "0"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
12349723982598
output:
1
result:
ok 1 number(s): "1"