//AC
#include <iostream> #include <cstdlib> #include <stdio.h> #include <algorithm> #include <math.h> #include <string.h> #include <queue> #include <stack> #include <vector> #include <map> #include <set> typedef long long ll; using namespace std; int main(){ string tel; int k,kk; int a[15]={0}; int b[15]; cin>>tel; for (int i=0; i<tel.size(); i++) { a[tel[i]-'0']=10; } k=0; for (int i=9; 0<=i; i--) { if(a[i]==10) b[k++]=i; } cout<<"int[] arr = new int[]{"<<b[0]; for (int i=1; i<k; i++) { cout<<","<<b[i]; } cout<<"};"<<endl; kk=0; cout<<"int[] index = new int[]{"; for (int i=0; i<tel.size(); i++) { for (int j=0; j<k; j++) { if(tel[i]-'0'== b[j] && i!=(tel.size()-1)){ //注意tel[] string 类型 cout<< j <<","; break; } if(tel[i]-'0'== b[j] && i==(tel.size()-1)){ cout<< j ; break; } } } cout<<"};"<<endl; return 0; }
