B. CopyCopyCopyCopyCopy

最新推荐文章于 2022-06-20 20:44:43 发布

chen_zan_yu_

最新推荐文章于 2022-06-20 20:44:43 发布

阅读量345

点赞数

本文链接：https://blog.csdn.net/chen_zan_yu_/article/details/104888237

版权

B. CopyCopyCopyCopyCopy

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Ehab has an array aa of length nn. He has just enough free time to make a new array consisting of nn copies of the old array, written back-to-back. What will be the length of the new array's longest increasing subsequence?

A sequence aa is a subsequence of an array bb if aa can be obtained from bb by deletion of several (possibly, zero or all) elements. The longest increasing subsequence of an array is the longest subsequence such that its elements are ordered in strictly increasing order.

Input

The first line contains an integer tt — the number of test cases you need to solve. The description of the test cases follows.

The first line of each test case contains an integer nn (1≤n≤1051≤n≤105) — the number of elements in the array aa.

The second line contains nn space-separated integers a1a1, a2a2, ……, anan (1≤ai≤1091≤ai≤109) — the elements of the array aa.

The sum of nn across the test cases doesn't exceed 105105.

Output

For each testcase, output the length of the longest increasing subsequence of aa if you concatenate it to itself nn times.

Example

input

Copy

2
3
3 2 1
6
3 1 4 1 5 9

output

Copy

3
5

Note

In the first sample, the new array is [3,2,1,3,2,1,3,2,1][3,2,1,3,2,1,3,2,1]. The longest increasing subsequence is marked in bold.

In the second sample, the longest increasing subsequence will be [1,3,4,5,9][1,3,4,5,9].

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        set<int>t;
        for(int i=0;i<n;i++)
        {
            int x;
            cin>>x;
            t.insert(x);
        }
        printf("%d\n",t.size());
    }
    return 0;
}