QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#689277 | #9313. Make Max | 202314170109 | WA | 0ms | 3596kb | C++17 | 486b | 2024-10-30 16:08:13 | 2024-10-30 16:08:21 |
Judging History
answer
#include <iostream>
#include<vector>
#include<stack>
using namespace std;
vector<int>a;
void readCase(){
int n;
cin>>n;
a.clear();
a.resize(n+1,0);
for(int i =1;i<a.size();i++){
cin>>a[i];
}
}
void returnCase(){
for(int i=1;i<a.size();i++){
cout<<" "<<a[i];
}
cout<<endl;
}
int main(){
int t;
cin>>t;
while(t--){
readCase();
returnCase();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3596kb
input:
4 2 1 2 2 2 2 7 1 1 1 2 2 2 2 3 1 2 3
output:
1 2 2 2 1 1 1 2 2 2 2 1 2 3
result:
wrong answer 2nd numbers differ - expected: '0', found: '2'