A. Olympiad Date

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;
}
相关推荐
在所不辞兄2 小时前
为什么数字孪生驱动的产线标定需要在线更新机制,而不能一次标定后长期沿用?
人工智能·神经网络·其他·算法·机器学习
无忧.芙桃3 小时前
C++语言原理与实践(二十三):哈希表的实现
c++·链表·哈希算法·散列表·哈希表
郝学胜-神的一滴5 小时前
Effective Python 条款36:优雅拼装迭代器与生成器
开发语言·数据结构·人工智能·python·numpy·scikit-learn
AvocadoZeroOneOI6 小时前
B4500 [GESP202603 三级] 凯撒密码 详细解题报告
c++·算法
cjz38998 小时前
双指针技巧:覆盖式双指针(原地覆盖)
算法
whitelbwwww8 小时前
cuBLAS--CUDA高性能线性代数计算库--第一部分
c++·线性代数·gpu算力·cuda c++
console.log('npc')10 小时前
Python 学习教程 · 第4课:数据结构
数据结构·python·学习
eggwyw11 小时前
C++设计模式之解释器模式
开发语言·c++
橘子1311 小时前
【高级数据库】关系代数基本概念
算法
电科_银尘1 天前
【大模型算法与工程 15】手写Self-Attention:Q、K、V与缩放点积
算法