C - たくさんの数式 / Many Formulas（位运算）

题目链接：https://atcoder.jp/contests/arc061/tasks/arc061_a

Problem Statement

You are given a string SS consisting of digits between 1 and 9, inclusive. You can insert the letter + into some of the positions (possibly none) between two letters in this string. Here, + must not occur consecutively after insertion.

All strings that can be obtained in this way can be evaluated as formulas.

Evaluate all possible formulas, and print the sum of the results.

Constraints

• 1≤|S|≤101≤|S|≤10
• All letters in SS are digits between 1 and 9, inclusive.

---

Input

The input is given from Standard Input in the following format:

SS

Output

Print the sum of the evaluated value over all possible formulas.

---

Sample Input 1 Copy

Copy

125

Sample Output 1 Copy

Copy

176

There are 44 formulas that can be obtained: 125, 1+25, 12+5 and 1+2+5. When each formula is evaluated,

• 125125
• 1+25=261+25=26
• 12+5=1712+5=17
• 1+2+5=81+2+5=8

Thus, the sum is 125+26+17+8=176125+26+17+8=176.

---

Sample Input 2 Copy

Copy

9999999999

Sample Output 2 Copy

Copy

12656242944

题意：
给你一个字符串（每位由0-9组成）你可以添加‘+’号问你所有可能运算的结果。

比如：125有：
     125

1+25=26

12+5=17

1+2+5=8

最终结果为125+26+17+8=176；

思路：

用二进制来表示添加+，比如‘01’为1+25，这里是反着来的。

代码：
 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
char s[20];
int main()
{
    scanf("%s",&s);
    int n=strlen(s);
    int w=1<<(n-1);
    ll sum=0;
    for(int i=0;i<w;i++)
    {
         ll t=s[0]-'0';
        for(int j=0;j<n;j++)
        {
           if(i&1<<j||j==n-1)//i的j+1位为1或到了最后。
           {
               sum+=t;
               t=0;
               if(j==n-1)break;
           }
            t=t*10+s[j+1]-'0';
        }
    }
    cout<<sum<<endl;
}