#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 j=1;
int val=0;
int sum=0;
for(int i=1;i<n;i++){
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+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRDb3VudChpbnQgeCl7CglpbnQgY291bnQ9MDsKCXdoaWxlKHghPTApewoJCXg9eC8xMDsKCQljb3VudCsrOwogCgl9CglyZXR1cm4gY291bnQ7Cn0KIAppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBhcnJbXT17MTAsMn07CglpbnQgbj1zaXplb2YoYXJyKS9zaXplb2YoYXJyWzBdKTsKCWludCBzdW1BcnJheT0wOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJc3VtQXJyYXk9c3VtQXJyYXkrYXJyW2ldOwoJfQoJaW50IGRpZ2l0WzEwXT17MH07ICAgICAgLy9kaWdpdCBhcnJheSB0byBnZXQgY291bnQgb2YgZGlnaXQgaW4gbnVtYmVyIAoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJaW50IHk9Z2V0Q291bnQoYXJyW2ldKTsKCQlkaWdpdFt5XT1kaWdpdFt5XSsxOwoJfQoJaW50IGo9MTsKCWludCB2YWw9MDsKCWludCBzdW09MDsKCWZvcihpbnQgaT0xO2k8bjtpKyspewoJCXdoaWxlKGo8PTYpeyAgICAgICAgICAvL0JlY3Vhc2UgdGhlIGNvbnRyYWludHMgaGFzIGEgbnVtYmVyIGNvbnRhaW5pbmcgdGhlIGRpZ2l0IHNpemUgb2YgNgoJCQl2YWwrPWFycltpXSpwb3coMTAsaikqZGlnaXRbal07IAoJCQlqKys7ICAgICAgICAgICAgICAgICAgICAgICAgIC8vd2hpbGUgbG9vb3AgdXNlZCB0byBnZXQgYWxsIGRpZ2l0IHNpemUgb2YgMSAsMiAuLiBmb3IgdGhlIGdpdmVuIGVsZW1lbnQgYXQgaSBhcyB3ZSB3YW50IGFsbCBwb3NzaWJsZSBudW1iZXIgZm9yIGl0aCBlbGVtZW50CgkJfQoJCXN1bSs9dmFsK3N1bUFycmF5OwoJfQoJY291dDw8IlRoZSBzdW0gaXM6Ijw8c3VtOwoJcmV0dXJuIDA7Cn0=