QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#689234#9313. Make Max202314170109WA 0ms3548kbC++14490b2024-10-30 15:58:332024-10-30 15:58:38

Judging History

你现在查看的是最新测评结果

  • [2024-10-30 15:58:38]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3548kb
  • [2024-10-30 15:58:33]
  • 提交

answer

// Example program
#include <iostream>
#include<vector>
#include<stack>
using namespace std;

vector<int>a;
void readCase(){
    int n;
    cin>>n;
    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: 3548kb

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'