QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #311014 | #5236. Wersja dla profesjonalistów [A] | c20230201 | 0 | 82ms | 3608kb | C++14 | 255b | 2024-01-21 20:53:47 | 2024-01-21 20:53:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n; cin>>n;
for(int i=n;i>1;i--) cout<<i<<'F'<<i-1<<"[BD]"<<"B";
cout<<"FB"<<n<<"D\n";
return 0;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 1
Accepted
time: 1ms
memory: 3532kb
input:
1
output:
FB1D
result:
ok correct (length = 3)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
2
output:
2F1[BD]BFB2D
result:
ok correct (length = 13)
Test #3:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
4
output:
4F3[BD]B3F2[BD]B2F1[BD]BFB4D
result:
ok correct (length = 30)
Test #4:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
5
output:
5F4[BD]B4F3[BD]B3F2[BD]B2F1[BD]BFB5D
result:
ok correct (length = 43)
Test #5:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
6
output:
6F5[BD]B5F4[BD]B4F3[BD]B3F2[BD]B2F1[BD]BFB6D
result:
ok correct (length = 53)
Test #6:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
7
output:
7F6[BD]B6F5[BD]B5F4[BD]B4F3[BD]B3F2[BD]B2F1[BD]BFB7D
result:
ok correct (length = 53)
Test #7:
score: -1
Wrong Answer
time: 0ms
memory: 3608kb
input:
10
output:
10F9[BD]B9F8[BD]B8F7[BD]B7F6[BD]B6F5[BD]B5F4[BD]B4F3[BD]B3F2[BD]B2F1[BD]BFB10D
result:
wrong answer invalid output
Subtask #2:
score: 0
Wrong Answer
Test #16:
score: 0
Wrong Answer
time: 0ms
memory: 3592kb
input:
320
output:
320F319[BD]B319F318[BD]B318F317[BD]B317F316[BD]B316F315[BD]B315F314[BD]B314F313[BD]B313F312[BD]B312F311[BD]B311F310[BD]B310F309[BD]B309F308[BD]B308F307[BD]B307F306[BD]B306F305[BD]B305F304[BD]B304F303[BD]B303F302[BD]B302F301[BD]B301F300[BD]B300F299[BD]B299F298[BD]B298F297[BD]B297F296[BD]B296F295[BD]B...
result:
wrong answer invalid output
Subtask #3:
score: 0
Wrong Answer
Test #28:
score: 0
Wrong Answer
time: 82ms
memory: 3532kb
input:
1000000
output:
1000000F999999[BD]B999999F999998[BD]B999998F999997[BD]B999997F999996[BD]B999996F999995[BD]B999995F999994[BD]B999994F999993[BD]B999993F999992[BD]B999992F999991[BD]B999991F999990[BD]B999990F999989[BD]B999989F999988[BD]B999988F999987[BD]B999987F999986[BD]B999986F999985[BD]B999985F999984[BD]B999984F9999...
result:
wrong answer the length of your output (17777788) exceeds the constraint (150000)
Subtask #4:
score: 0
Wrong Answer
Test #37:
score: 0
Wrong Answer
time: 82ms
memory: 3608kb
input:
999999
output:
999999F999998[BD]B999998F999997[BD]B999997F999996[BD]B999996F999995[BD]B999995F999994[BD]B999994F999993[BD]B999993F999992[BD]B999992F999991[BD]B999991F999990[BD]B999990F999989[BD]B999989F999988[BD]B999988F999987[BD]B999987F999986[BD]B999986F999985[BD]B999985F999984[BD]B999984F999983[BD]B999983F99998...
result:
wrong answer the length of your output (17777768) exceeds the constraint (150000)
Subtask #5:
score: 0
Output Limit Exceeded
Test #46:
score: 0
Output Limit Exceeded
input:
10000000000
output:
2147483647F2147483646[BD]B2147483646F2147483645[BD]B2147483645F2147483644[BD]B2147483644F2147483643[BD]B2147483643F2147483642[BD]B2147483642F2147483641[BD]B2147483641F2147483640[BD]B2147483640F2147483639[BD]B2147483639F2147483638[BD]B2147483638F2147483637[BD]B2147483637F2147483636[BD]B2147483636F214...
result:
Subtask #6:
score: 0
Time Limit Exceeded
Test #55:
score: 0
Time Limit Exceeded
input:
9999999999
output:
2147483647F2147483646[BD]B2147483646F2147483645[BD]B2147483645F2147483644[BD]B2147483644F2147483643[BD]B2147483643F2147483642[BD]B2147483642F2147483641[BD]B2147483641F2147483640[BD]B2147483640F2147483639[BD]B2147483639F2147483638[BD]B2147483638F2147483637[BD]B2147483637F2147483636[BD]B2147483636F214...
result:
Subtask #7:
score: 0
Output Limit Exceeded
Test #64:
score: 0
Output Limit Exceeded
input:
100000000000000
output:
2147483647F2147483646[BD]B2147483646F2147483645[BD]B2147483645F2147483644[BD]B2147483644F2147483643[BD]B2147483643F2147483642[BD]B2147483642F2147483641[BD]B2147483641F2147483640[BD]B2147483640F2147483639[BD]B2147483639F2147483638[BD]B2147483638F2147483637[BD]B2147483637F2147483636[BD]B2147483636F214...
result:
Subtask #8:
score: 0
Time Limit Exceeded
Test #84:
score: 0
Time Limit Exceeded
input:
99999999999999
output:
2147483647F2147483646[BD]B2147483646F2147483645[BD]B2147483645F2147483644[BD]B2147483644F2147483643[BD]B2147483643F2147483642[BD]B2147483642F2147483641[BD]B2147483641F2147483640[BD]B2147483640F2147483639[BD]B2147483639F2147483638[BD]B2147483638F2147483637[BD]B2147483637F2147483636[BD]B2147483636F214...
result:
Subtask #9:
score: 0
Time Limit Exceeded
Test #103:
score: 0
Time Limit Exceeded
input:
1000000000000000000
output:
2147483647F2147483646[BD]B2147483646F2147483645[BD]B2147483645F2147483644[BD]B2147483644F2147483643[BD]B2147483643F2147483642[BD]B2147483642F2147483641[BD]B2147483641F2147483640[BD]B2147483640F2147483639[BD]B2147483639F2147483638[BD]B2147483638F2147483637[BD]B2147483637F2147483636[BD]B2147483636F214...
result:
Subtask #10:
score: 0
Time Limit Exceeded
Test #128:
score: 0
Time Limit Exceeded
input:
999999999999999999
output:
2147483647F2147483646[BD]B2147483646F2147483645[BD]B2147483645F2147483644[BD]B2147483644F2147483643[BD]B2147483643F2147483642[BD]B2147483642F2147483641[BD]B2147483641F2147483640[BD]B2147483640F2147483639[BD]B2147483639F2147483638[BD]B2147483638F2147483637[BD]B2147483637F2147483636[BD]B2147483636F214...