18113 Secret Book of Kungfu 按位DFS

http://acm.scau.edu.cn:8000/uoj/mainMenu.html

18113 Secret Book of Kungfu

该题有题解

时间限制:1000MS  内存限制:65535K
提交次数:0 通过次数:0

题型: 编程题   语言: 不限定

Description

    Uncle Big is acknowledged as a master of kung fu. But he doesn't think so. He thinks that there are many other unknown
experts in the world. So Uncle Big devotes all his life to find the highest realm of kung fu.
    During a chance, Uncle Big discover a secret book of kungfu in a cave. But the book is broken and losts many pages. What's
worst, there's only some numbers writted on the book. After studying the book years and years, Uncle Big discover that all
this numbers have a common feature that, the decimal notation of a number is a substring of its binary notation. So Uncle
Big want to restore the book, in order to better understand it. Before doing this, Uncle Big has to know how many such numbers
between l and r (inclusive).
    But now Uncle Big is so exciting because of this discovering, and has gone to race boat. Can you help him?

输入格式

    The input file begins with an integer T (T <= 10000) in one row indicating the number of test case. Then T test cases
follows.
    Each test case contains one line with two non-negetive integer l and r (l <= r <= 1000000000000000(1e15) ).

输出格式

    For each test case, print one line with a integer as answer.

输入样例

1
1 1000

输出样例

8

提示

"1", "0", "10", "01", "101" are the substring of "101", but "11", "00" are not.

考虑按位DFS后再暴力判断，然后发现总数只有283个，记得加上0，就284个。打个表二分查找就好。

dfs数字的话，一般就是dfs(cur * 10 + 0)，这个数位进位后，然后加上想要的数字

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;

#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
LL L, R;
int ans;
char str_bin[];
char num[];
int lenstr;
void bin(LL n) {
    if (n / ) bin(n / );
    str_bin[++lenstr] = n %  + '';
}
LL biao[ + ];
int lenbiao;
void dfs(LL cur) {
    if (cur >= L && cur <= R) {
        lenstr = ;
        bin(cur);
        int k = ;
        LL t = cur;
        while (t /  > ) {
            num[++k] = t %  + '';
            t /= ;
        }
        num[++k] = t + '';
        num[k + ] = '\0';
        str_bin[lenstr + ] = '\0';
//         cout << str_bin + 1 << endl;

        reverse(num + , num +  + k);
//        cout << num + 1 << endl;
//        cout << endl;
        char *p = strstr(str_bin + , num + );
        if (p != NULL)
            biao[++lenbiao] = cur;
    }
    if (cur > R) return;
    dfs(cur * );
    dfs(cur *  + );
}
void work() {
    cin >> L >> R;
    if (L > R) swap(L, R);
    int posR = lower_bound(biao + , biao +  + lenbiao, R) - biao;
    int posL = lower_bound(biao + , biao +  + lenbiao, L) - biao;
    if (biao[posL] == L && biao[posR] == R) {
        cout << posR - posL +  << endl;
    } else if (biao[posL] == L && biao[posR] != R) {
        cout << posR - posL << endl;
    } else if (biao[posL] != L && biao[posR] == R) {
        cout << posR - posL +  << endl;
    } else {
        cout << posR - posL << endl;
    }
}
void init() {
    biao[++lenbiao] = ;
    L = ;
    R = 1e15L;
    dfs();
    sort(biao + , biao +  + lenbiao);
}
int main() {
#ifdef local
    freopen("data.txt","r",stdin);
#endif
    IOS;
    init();
    int t;
    cin >> t;
    while (t--) work();
    return ;
}