Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int a[1000];
- int digitCounter(int n){
- int counter=0;
- int digit;
- if(n==0){
- return 1;
- }
- else{
- while(n!=0){
- digit=n%10;
- a[counter]=digit;
- n=n/10;
- ++counter;
- }
- return counter;
- }
- }
- int Power(int n)
- {
- int base=1;
- for(int i=0;i<n;i++){
- base=base*2;
- }
- return base;
- }
- int main()
- {
- int n;
- for(int k=0;;k++){
- double skew=0;
- cin>>n;
- if(n==0){
- break;
- }
- else{
- for(int i=0;i<digitCounter(n);i++){
- skew=skew+a[i]*(Power(i+1)-1);
- // cout<<a[i];
- }
- /* cout<<digitCounter(n);
- */
- /*int pow;
- cin>>pow;
- cout<<Power(pow);
- */
- cout<<skew<<endl;;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement