#include <bits/stdc++.h>
using namespace std;
int getCount(int x){
int count=0;
while(x!=0){
x=x/10;
count++;
}
return count;
}
int main() {
// your code goes here
int arr[]={10,2};
int n=sizeof(arr)/sizeof(arr[0]);
int sumArray=0;
for(int i=0;i<n;i++){
sumArray=sumArray+arr[i];
}
int digit[10]={0}; //digit array to get count of digit in number
for(int i=0;i<n;i++){
int y=getCount(arr[i]);
digit[y]=digit[y]+1;
}
int sum=0;
for(int i=0;i<n;i++){
int j=1;
int val=0;
while(j<=6){ //Becuase the contraints has a number containing the digit size of 6
val+=arr[i]*pow(10,j)*digit[j];
j++; //while looop used to get all digit size of 1 ,2 .. for the given element at i as we want all possible number for ith element
}
sum+=val+sumArray;
}
cout<<"The sum is:"<<sum;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRDb3VudChpbnQgeCl7CglpbnQgY291bnQ9MDsKCXdoaWxlKHghPTApewoJCXg9eC8xMDsKCQljb3VudCsrOwogCgl9CglyZXR1cm4gY291bnQ7Cn0KIAppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBhcnJbXT17MTAsMn07CglpbnQgbj1zaXplb2YoYXJyKS9zaXplb2YoYXJyWzBdKTsKCWludCBzdW1BcnJheT0wOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJc3VtQXJyYXk9c3VtQXJyYXkrYXJyW2ldOwoJfQoJaW50IGRpZ2l0WzEwXT17MH07ICAgICAgLy9kaWdpdCBhcnJheSB0byBnZXQgY291bnQgb2YgZGlnaXQgaW4gbnVtYmVyIAoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJaW50IHk9Z2V0Q291bnQoYXJyW2ldKTsKCQlkaWdpdFt5XT1kaWdpdFt5XSsxOwoJfQogCglpbnQgc3VtPTA7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlpbnQgaj0xOwoJCWludCB2YWw9MDsKCQl3aGlsZShqPD02KXsgICAgICAgICAgLy9CZWN1YXNlIHRoZSBjb250cmFpbnRzIGhhcyBhIG51bWJlciBjb250YWluaW5nIHRoZSBkaWdpdCBzaXplIG9mIDYKCQkJdmFsKz1hcnJbaV0qcG93KDEwLGopKmRpZ2l0W2pdOyAKCQkJaisrOyAgICAgICAgICAgICAgICAgICAgICAgICAvL3doaWxlIGxvb29wIHVzZWQgdG8gZ2V0IGFsbCBkaWdpdCBzaXplIG9mIDEgLDIgLi4gZm9yIHRoZSBnaXZlbiBlbGVtZW50IGF0IGkgYXMgd2Ugd2FudCBhbGwgcG9zc2libGUgbnVtYmVyIGZvciBpdGggZWxlbWVudAoJCX0KCQlzdW0rPXZhbCtzdW1BcnJheTsKCX0KCWNvdXQ8PCJUaGUgc3VtIGlzOiI8PHN1bTsKCXJldHVybiAwOwp9