360笔试题交流

#include <iostream> #include <vector> #include <string> using namespace std; int main() { string s; while(cin >> s){ const int sz = s.size(); int cnt = pow(2,sz)-1; for(int i = 0;i<sz;i++) { if(s[i]>'1') break; else if(s[i]=='0') cnt -= pow(2,sz-i-1); } cout << cnt << endl; } return 0; }

#include<iostream> #include<vector> using namespace std; int help(vector<int> vt) { vector<int> tmp{1,2,4,8,16,32,64,128}; for (int i = 8; i >= 0; --i) { if (vt[i]>1) { return (2 << i) - 1; } else { if (vt[i] == 1) { int ans = (2 << i); int j = i - 1; while (j >= 0 && vt[j] <= 1) { if (vt[j] == 0) ans -= tmp[j]; j--; } return ans-1; } } } return 0; } int main() { unsigned long long n; while (cin >> n) { vector<int> vt(10, 0); int i = 0; while (n) { vt[i++] = n % 10; n /= 10; } if (vt[9] == 1) { cout << 512 << endl; } else{ cout << help(vt) << endl; } } return 0; }

import java.util.Scanner; public class Main { private static int bingdu(String cur, int n) { if (cur.length() > 10 || Integer.parseInt(cur) > n) { return 0; } else { return 1 + bingdu(cur + "0", n) + bingdu(cur + "1", n); } } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNextInt()) { int n = scanner.nextInt(); System.out.println(bingdu("1", n)); } scanner.close(); } }

同这样的思路 你是不是ac50%？     还有一部分超时。。。 同学直接转成字符串 查0 1.。。 就ac了