zzuli 1068《二进制数》

/**

  *题目链接：http://acm.zzuli.edu.cn/problem.php?id=1068

 */

#include <iostream>#include <cstdio>#include <cstring>#include <string>using namespace std;//运用秦九韶算法 f(x) = (((a0x+a1)x+a2)*x+a3)x+a4 ......)x+an;这样不会超时。void solve(){//freopen("in.txt","r",stdin);string str;cin >> str;int t = (str[0]-'0')*2+(str[1]-'0');//cout << t<<endl; for(int i = 2; i < str.length() ; i++){    t =t*2+(str[i]-'0');}cout << t << endl;}int main(){solve();return 0;}