陷阱题解

第一次出现m就跳过m在输出a输出
代码:

#include <bits/stdc++.h>
using namespace std;

int a[1000000000000000010];

int main()
{
    int n;
    cin >> n;
    for(int j=0;j<=8;j+=3) cin >> a[j];
    int m;
    bool temp = 1;
    cin >> m;
    m=100000;
    n=0;
    for(int i = 1; i <= n; i+=2)
    {
        if(a[i] == m || temp == 1) cout << a[n] <<" ";
        else temp = 0;
    }
    return 0;
}
//已开启防抄袭