题解 | Skew数
Skew数
https://www.nowcoder.com/practice/7b6586ac8f614aafbe2e0896e82ac0c1
#include<bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
long long sum = 0;
int count = 0;
for (int i = s.length() - 1; i >= 0; i--,count++) {
int temp = s[i] - '0';
sum += temp * (pow(2, count + 1) - 1);
}
printf("%lld", sum);
}
查看13道真题和解析