time limit per test
1 second
memory limit per test
256 megabytes
The final of the first Olympiad by IT Campus "NEIMARK" is scheduled for March 1, 2025. A nameless intern was tasked with forming the date of the Olympiad using digits --- 01.03.2025.
To accomplish this, the intern took a large bag of digits and began drawing them one by one. In total, he drew nn digits --- the digit aiai was drawn in the ii-th turn.
You suspect that the intern did extra work. Determine at which step the intern could have first assembled the digits to form the date of the Olympiad (the separating dots can be ignored), or report that it is impossible to form this date from the drawn digits. Note that leading zeros must be displayed.
Input
Each test contains multiple test cases. The first line contains the number of test cases tt (1≤t≤1041≤t≤104). The description of the test cases follows.
The first line of each test case contains a single integer nn (1≤n≤201≤n≤20).
The second line of each test case contains nn integers aiai (0≤ai≤90≤ai≤9) --- the numbers that the intern pulled out in chronological order.
Output
For each test case, output the minimum number of digits that the intern could pull out. If all the digits cannot be used to make a date, output the number 00.
Example
Input
Copy
4
10
2 0 1 2 3 2 5 0 0 1
8
2 0 1 2 3 2 5 0
8
2 0 1 0 3 2 5 0
16
2 3 1 2 3 0 1 9 2 1 0 3 5 4 0 3
Output
Copy
9
0
8
15解题说明：水题，直接遍历数组判断是否找出所需要的所有数字即可。
cpp
#include <iostream>
#include<algorithm>
using namespace std;
int main()
{
int t = 1;
cin >> t;
while (t--)
{
int n = 0;
cin >> n;
int a[21];
int mp[11] = {0};
int ans = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
mp[a[i]]++;
if (mp[0] >= 3 && mp[1] >= 1 && mp[2] >= 2 && mp[3] >= 1 && mp[5] >= 1 && ans == 0)
{
ans = i;
}
}
cout << ans << endl;
}
return 0;
}