PIN Codes CodeForces - 1263B

最新推荐文章于 2020-06-23 10:23:06 发布

Tizzii

最新推荐文章于 2020-06-23 10:23:06 发布

阅读量679

点赞数

CC 4.0 BY-SA版权

分类专栏： CF greedy

本文链接：https://blog.csdn.net/qq_41280600/article/details/103402561

CF 同时被 2 个专栏收录

60 篇文章

订阅专栏

greedy

3 篇文章

订阅专栏

本文介绍了一种解决银行卡片PIN码差异最小化问题的算法，通过修改最少次数使所有PIN码变得不同。核心思想是在遇到重复PIN码时，通过改变任意一位数字来创建唯一码。文章提供了一个C++实现示例，展示了如何使用哈希映射来跟踪PIN码出现的频率，并有效地找到未使用的数字进行替换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

一、内容

A PIN code is a string that consists of exactly 4

digits. Examples of possible PIN codes: 7013, 0000 and 0990. Please note that the PIN code can begin with any digit, even with 0.Polycarp has n(2≤n≤10) bank cards, the PIN code of the i-th card is pi.Polycarp has recently read a recommendation that it is better to set different PIN codes on different cards. Thus he wants to change the minimal number of digits in the PIN codes of his cards so that all ncodes would become different.Formally, in one step, Polycarp picks i
-th card (1≤i≤n), then in its PIN code pi selects one position (from 1 to 4), and changes the digit in this position to any other. He needs to change the minimum number of digits so that all PIN codes become different.
Polycarp quickly solved this problem. Can you solve it?

Input

The first line contains integer t(1≤t≤100) — the number of test cases in the input. Then test cases follow.The first line of each of t test sets contains a single integer n (2≤n≤10) — the number of Polycarp's bank cards. The next n lines contain the PIN codes p1,p2,…,pn — one per line. The length of each of them is 4. All PIN codes consist of digits only.

Output

	Print the answers to ttest sets. The answer to each set should consist of a n+1linesIn the first line print k— the least number of changes to make all PIN codes different. In the next nlines output the changed PIN codes in the order corresponding to their appearance in the input. If there are several optimal answers, print any of them.

Input

Output

二、思路

由于只有10个数字，所以只需要随便修改一位上面的数字就可以让n个数字不同。

三、代码

#include <cstdio>
#include <map>
#include <cstring>
#include <iostream>
using namespace std;
int t, n;
string str[15];
int main() {
	scanf("%d", &t);
	while (t--) {
		map<string, int> mp;
		scanf("%d", &n);
		for (int i = 1; i <= n; i++) {
			cin >> str[i];
			mp[str[i]]++;
		}
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			if (mp[str[i]] == 1) continue;
			ans++;
			mp[str[i]]--;
			//替换字符
			for (int j = 0; j <= 9; j++) {
				str[i][0] = '0' + j;
				if (mp[str[i]] == 0) {
					mp[str[i]]++;
					break;
				}
			} 
		}
		cout << ans << endl; 
		for (int i = 1; i <= n; i++) {
			cout << str[i] << endl;
		}
	} 
	return 0;
}