L1-027 rental (20 points)

L1-027 lease (20 branch )

Here is a picture of sina Weibo that used to be very popular ：

At one time, the Internet was full of cries for help , How to break this . In fact, this code is very simple ,index Array is arr Index of the array ,index[0]=2 Corresponding arr[2]=1,index[1]=0 Corresponding arr[0]=8,index[2]=3 Corresponding arr[3]=0, And so on …… It's easy to get a phone number 18013820100.

This question asks you to write a program , Generate this code for any phone number —— in fact , Just generate the first two lines , The rest is the same .

Input format ：
Type in a line to give a result of 11 A cell phone number made up of digits .

Output format ：
Generate the first two lines of code for the entered number , among arr The numbers in must be given in descending order .

sample input ：

18013820100

sample output ：

int[] arr = new int[]{8,3,2,1,0};
int[] index = new int[]{3,0,4,3,1,0,2,4,3,4,4};

AC Code

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<sstream>

using namespace std;
typedef long long ll;
const int N=100010;

bool bo[15];

int main()
{
    
	string a;
	cin >> a;
	int arr[15];
	for(int i = 0; i < a.size(); i ++ )
		if(!bo[a[i] - '0']) bo[a[i] - '0'] = true;
	int k = 0;
	for(int i = 9; i >= 0; i -- )
		if(bo[i]) arr[k ++ ] = i;
	int index[15];
	int l = 0;
	for(int i = 0; i < a.size(); i ++ )
		for(int j = 0; j < k; j ++ )
			if(a[i] - '0' == arr[j])
				index[l ++ ] = j;
	cout << "int[] arr = new int[]{";
	for(int i = 0; i < k; i ++ )
	{
    
		if(i != k - 1) cout << arr[i] << ',';
		else cout << arr[i] << "};" << endl;
	}
	cout << "int[] index = new int[]{";
	for(int i = 0; i < l; i ++ )
	{
    
		if(i != l - 1) cout << index[i] << ',';
		else cout << index[i] << "};" << endl;
	}
	return 0;
}