QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #463062 | #5236. Wersja dla profesjonalistów [A] | _Nangu_ | 0 | 87ms | 3696kb | C++14 | 752b | 2024-07-04 12:54:49 | 2024-07-04 12:54:49 |
Judging History
answer
#include<bits/stdc++.h>
#define F(i, j, k) for(int i=(j), ENDD=(k); i<=ENDD; ++i)
#define R(i, j, k) for(int i=(j), ENDD=(k); i>=ENDD; --i)
#define G(v, i, u) for(int i=head[u], v=e[i].v; i; v=e[i=e[i].nxt].v)
#define de(x) cout<<#x<<" "<<x<<" "
#define nd cout<<endl
#define P cout<<"Line:"<<" "<<__LINE__<<endl
#define fin(x) freopen(x, "r", stdin)
#define fout(x) freopen(x, "w", stdout)
using namespace std;
int m;
void dfs(int n){
if(n==1){
cout<<"AE"<<m<<'C';
return;
}
cout<<n<<'A';
if(n>2) cout<<n-1<<"[EC]"<<'E';
else cout<<"ECE";
dfs(n-1);
}
void run(){
cin>>m;
dfs(m);
}
signed main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T=1;
while(T--) run();
return 0;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 1
Accepted
time: 0ms
memory: 3696kb
input:
1
output:
AE1C
result:
ok correct (length = 3)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
2
output:
2AECEAE2C
result:
ok correct (length = 13)
Test #3:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
4
output:
4A3[EC]E3A2[EC]E2AECEAE4C
result:
ok correct (length = 30)
Test #4:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
5
output:
5A4[EC]E4A3[EC]E3A2[EC]E2AECEAE5C
result:
ok correct (length = 43)
Test #5:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
6
output:
6A5[EC]E5A4[EC]E4A3[EC]E3A2[EC]E2AECEAE6C
result:
ok correct (length = 53)
Test #6:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
7
output:
7A6[EC]E6A5[EC]E5A4[EC]E4A3[EC]E3A2[EC]E2AECEAE7C
result:
ok correct (length = 53)
Test #7:
score: -1
Wrong Answer
time: 0ms
memory: 3644kb
input:
10
output:
10A9[EC]E9A8[EC]E8A7[EC]E7A6[EC]E6A5[EC]E5A4[EC]E4A3[EC]E3A2[EC]E2AECEAE10C
result:
wrong answer invalid output
Subtask #2:
score: 0
Wrong Answer
Test #16:
score: 0
Wrong Answer
time: 0ms
memory: 3656kb
input:
320
output:
320A319[EC]E319A318[EC]E318A317[EC]E317A316[EC]E316A315[EC]E315A314[EC]E314A313[EC]E313A312[EC]E312A311[EC]E311A310[EC]E310A309[EC]E309A308[EC]E308A307[EC]E307A306[EC]E306A305[EC]E305A304[EC]E304A303[EC]E303A302[EC]E302A301[EC]E301A300[EC]E300A299[EC]E299A298[EC]E298A297[EC]E297A296[EC]E296A295[EC]E...
result:
wrong answer invalid output
Subtask #3:
score: 0
Wrong Answer
Test #28:
score: 0
Wrong Answer
time: 66ms
memory: 3632kb
input:
1000000
output:
1000000A999999[EC]E999999A999998[EC]E999998A999997[EC]E999997A999996[EC]E999996A999995[EC]E999995A999994[EC]E999994A999993[EC]E999993A999992[EC]E999992A999991[EC]E999991A999990[EC]E999990A999989[EC]E999989A999988[EC]E999988A999987[EC]E999987A999986[EC]E999986A999985[EC]E999985A999984[EC]E999984A9999...
result:
wrong answer the length of your output (17777785) exceeds the constraint (150000)
Subtask #4:
score: 0
Wrong Answer
Test #37:
score: 0
Wrong Answer
time: 87ms
memory: 3652kb
input:
999999
output:
999999A999998[EC]E999998A999997[EC]E999997A999996[EC]E999996A999995[EC]E999995A999994[EC]E999994A999993[EC]E999993A999992[EC]E999992A999991[EC]E999991A999990[EC]E999990A999989[EC]E999989A999988[EC]E999988A999987[EC]E999987A999986[EC]E999986A999985[EC]E999985A999984[EC]E999984A999983[EC]E999983A99998...
result:
wrong answer the length of your output (17777765) exceeds the constraint (150000)
Subtask #5:
score: 0
Output Limit Exceeded
Test #46:
score: 0
Output Limit Exceeded
input:
10000000000
output:
2147483647A2147483646[EC]E2147483646A2147483645[EC]E2147483645A2147483644[EC]E2147483644A2147483643[EC]E2147483643A2147483642[EC]E2147483642A2147483641[EC]E2147483641A2147483640[EC]E2147483640A2147483639[EC]E2147483639A2147483638[EC]E2147483638A2147483637[EC]E2147483637A2147483636[EC]E2147483636A214...
result:
Subtask #6:
score: 0
Output Limit Exceeded
Test #55:
score: 0
Output Limit Exceeded
input:
9999999999
output:
2147483647A2147483646[EC]E2147483646A2147483645[EC]E2147483645A2147483644[EC]E2147483644A2147483643[EC]E2147483643A2147483642[EC]E2147483642A2147483641[EC]E2147483641A2147483640[EC]E2147483640A2147483639[EC]E2147483639A2147483638[EC]E2147483638A2147483637[EC]E2147483637A2147483636[EC]E2147483636A214...
result:
Subtask #7:
score: 0
Output Limit Exceeded
Test #64:
score: 0
Output Limit Exceeded
input:
100000000000000
output:
2147483647A2147483646[EC]E2147483646A2147483645[EC]E2147483645A2147483644[EC]E2147483644A2147483643[EC]E2147483643A2147483642[EC]E2147483642A2147483641[EC]E2147483641A2147483640[EC]E2147483640A2147483639[EC]E2147483639A2147483638[EC]E2147483638A2147483637[EC]E2147483637A2147483636[EC]E2147483636A214...
result:
Subtask #8:
score: 0
Output Limit Exceeded
Test #84:
score: 0
Output Limit Exceeded
input:
99999999999999
output:
2147483647A2147483646[EC]E2147483646A2147483645[EC]E2147483645A2147483644[EC]E2147483644A2147483643[EC]E2147483643A2147483642[EC]E2147483642A2147483641[EC]E2147483641A2147483640[EC]E2147483640A2147483639[EC]E2147483639A2147483638[EC]E2147483638A2147483637[EC]E2147483637A2147483636[EC]E2147483636A214...
result:
Subtask #9:
score: 0
Output Limit Exceeded
Test #103:
score: 0
Output Limit Exceeded
input:
1000000000000000000
output:
2147483647A2147483646[EC]E2147483646A2147483645[EC]E2147483645A2147483644[EC]E2147483644A2147483643[EC]E2147483643A2147483642[EC]E2147483642A2147483641[EC]E2147483641A2147483640[EC]E2147483640A2147483639[EC]E2147483639A2147483638[EC]E2147483638A2147483637[EC]E2147483637A2147483636[EC]E2147483636A214...
result:
Subtask #10:
score: 0
Output Limit Exceeded
Test #128:
score: 0
Output Limit Exceeded
input:
999999999999999999
output:
2147483647A2147483646[EC]E2147483646A2147483645[EC]E2147483645A2147483644[EC]E2147483644A2147483643[EC]E2147483643A2147483642[EC]E2147483642A2147483641[EC]E2147483641A2147483640[EC]E2147483640A2147483639[EC]E2147483639A2147483638[EC]E2147483638A2147483637[EC]E2147483637A2147483636[EC]E2147483636A214...