Codeforces Round #634 (Div. 3)

B. Construct the String

You are given three positive integers n, a and b. You have to construct a string s of length n consisting of lowercase Latin letters such that each substring of length a has exactly b distinct letters. It is guaranteed that the answer exists.

You have to answer t independent test cases.

Recall that the substring s[l…r] is the string sl,sl+1,…,sr and its length is r−l+1. In this problem you are only interested in substrings of length a.

Input
The first line of the input contains one integer t (1≤t≤2000) — the number of test cases. Then t test cases follow.

The only line of a test case contains three space-separated integers n, a and b (1≤a≤n≤2000,1≤b≤min(26,a)), where n is the length of the required string, a is the length of a substring and b is the required number of distinct letters in each substring of length a.

It is guaranteed that the sum of n over all test cases does not exceed 2000 (∑n≤2000).

Output
For each test case, print the answer — such a string s of length n consisting of lowercase Latin letters that each substring of length a has exactly b distinct letters. If there are multiple valid answers, print any of them. It is guaranteed that the answer exists.

Example
inputCopy
4
7 5 3
6 1 1
6 6 1
5 2 2
outputCopy
tleelte
qwerty
vvvvvv
abcde
Note
In the first test case of the example, consider all the substrings of length 5:

“tleel”: it contains 3 distinct (unique) letters,
“leelt”: it contains 3 distinct (unique) letters,
“eelte”: it contains 3 distinct (unique) letters.
思路：一般这种 往外输出一些有规律的串或者是数字都是很简单的形式不用想的太复杂，你看他说总长度是n 每长度a就有b个不一样的字母，那你就顺着往外输出呗

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
using namespace std;
#define inf 0x3f3f3f3f3f;
typedef long long ll;
int main()
{
	int t; cin >> t;
	while (t--)
	{
		int n, a, b; cin >> n >> a >> b;
		while (n>0)
		{
			for (int i = 0; i < b; i++)
			{
				char c = 97 + i;
				cout << c;
				n--;
				if (n <= 0) break;
			}
			
		}
		cout << endl;
	}
	
}

C. Two Teams Composing
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You have n students under your control and you have to compose exactly two teams consisting of some subset of your students. Each student had his own skill, the i-th student skill is denoted by an integer ai (different students can have the same skills).

So, about the teams. Firstly, these two teams should have the same size. Two more constraints:

The first team should consist of students with distinct skills (i.e. all skills in the first team are unique).
The second team should consist of students with the same skills (i.e. all skills in the second team are equal).
Note that it is permissible that some student of the first team has the same skill as a student of the second team.

Consider some examples (skills are given):

[1,2,3], [4,4] is not a good pair of teams because sizes should be the same;
[1,1,2], [3,3,3] is not a good pair of teams because the first team should not contain students with the same skills;
[1,2,3], [3,4,4] is not a good pair of teams because the second team should contain students with the same skills;
[1,2,3], [3,3,3] is a good pair of teams;
[5], [6] is a good pair of teams.
Your task is to find the maximum possible size x for which it is possible to compose a valid pair of teams, where each team size is x (skills in the first team needed to be unique, skills in the second team should be the same between them). A student cannot be part of more than one team.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1≤n≤2⋅105) — the number of students. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤n), where ai is the skill of the i-th student. Different students can have the same skills.

It is guaranteed that the sum of n over all test cases does not exceed 2⋅105 (∑n≤2⋅105).

Output
For each test case, print the answer — the maximum possible size x for which it is possible to compose a valid pair of teams, where each team size is x.

Example
inputCopy
4
7
4 2 4 1 4 3 4
5
2 1 5 4 3
1
1
4
1 1 1 3
outputCopy
3
1
0
2
Note
In the first test case of the example, it is possible to construct two teams of size 3: the first team is [1,2,4] and the second team is [4,4,4]. Note, that there are some other ways to construct two valid teams of size 3.

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
using namespace std;
#define inf 0x3f3f3f3f3f;
typedef long long ll;
vector <int>a;
int main()
{
	int t; cin >> t;
	while (t--)
	{
		int n; cin >> n;
		for (int i =0; i <n; i++)
		{
			int t; cin >> t;
			a.push_back(t);
		}
		sort(a.begin(),a.end());
		int s = 1, maxx = 0;
		for (int i = 1; i < n; i++)
		{
			if (a[i - 1] == a[i])
			{
				s++;
				if (i == n - 1)
				{
					maxx = max(maxx, s);
				}
			}
			else
			{
				maxx = max(maxx, s);
				s = 1;
			}
		}
		sort(a.begin(), a.end());
		a.erase(unique(a.begin(), a.end()), a.end());
		int z = a.size();
		if (z <= maxx - 1)
			cout << z << endl;
		else if (z == maxx)
			cout << z - 1 << endl;
		else if (z > maxx)
			cout << maxx << endl;
		a.clear();
		
		

	
	}
	
}