浙工大15新生决赛 找假币

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int Lu[8], Hui[8];
for (int i = 0; i < 7; i++) {
cin >> Lu[i];
Hui[i] = Lu[i];
}
sort(Hui, Hui + 7);
int n;
if (Hui[0] == Hui[1])
n = Hui[6];
else if (Hui[6] == Hui[5])
n = Hui[0];
for(int i = 0; i < 7; i++)
if (Lu[i] == n) {
printf("%d\n", i + 1);
break;
}
}
return 0;
}