From 486530f7c7bc4ea87193eaa4908383a4b18f8563 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Sun, 10 Mar 2024 09:32:16 +0800
Subject: [PATCH] 'commit'

---
 .../LanQiao15STEMA202401/密码锁.cpp        | 58 +++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/密码锁.cpp

diff --git a/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/密码锁.cpp b/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/密码锁.cpp
new file mode 100644
index 0000000..dbaa17d
--- /dev/null
+++ b/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/密码锁.cpp
@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+bool isAllZero(string s) {
+	for (int i = 0; i < s.size(); i++)
+		if (s[i] != '0')
+			return false;
+	return true;
+}
+
+struct Node {
+	char c; //�ַ�
+	int count;//����
+	int st, ed;//��ʼλ�ã�ֹͣλ��
+	bool const operator<(const &Node t) {
+		// �����������ȣ���ô���������ǰ
+		if (count != t.count)
+			return count > t.count;
+		// ���������ȣ��Dz��Ǵ����������
+		if (st < t.st && ed > t.ed)//�����ṹ��Աȣ������һ�������ڶ�������ô��һ����ǰ������ڶ�����ǰ
+			return false;
+		//Ĭ��ֵ�ǵڶ�����ǰ
+		return true;
+	}
+};
+
+int b[10];
+
+void tj() {
+	memset(b, 0, sizeof b);
+	vector<pair<int, int>> q;
+	for (int i = 0; i < s.size(); i++) {
+		if (s[i] != '0')
+			b[s[i] - '0']++;
+	}
+	for (int i = 1; i <= 9; i++)
+		if (b[i])
+			q.push_back({ b[i], i});
+	sort(q.begin(), q.end());
+
+	for (int i = 0; i < q.size(); i++)
+		//TODO��������������û�м�¼��ֹλ�ã���Ҫ����ʵ��
+	}
+
+
+vector<Node> a;
+
+
+int main() {
+	int n;
+	string s;
+	cin >> n >> s;
+
+	while (!isAllZero(s)) {
+
+	}
+	return 0;
+}