题解 | #skew数#
skew数
https://www.nowcoder.com/practice/5928127cc6604129923346e955e75984
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int i;
string s;
unsigned long int n;
while(cin>>s){
n=0;
for(i=0;s[i]!='\0';i++){
n+=(s[i]-'0')*((1<<(s.size()-i))-1);
if(s[i]=='2') break;
}
cout<<n<<endl;
}
}
