计蒜客2019蓝桥杯国赛B组模拟赛 101串(结果填空)

计蒜客2019蓝桥杯国赛B组模拟赛题解汇总：

https://blog.csdn.net/daixinliangwyx/article/details/90231587

 

第二题

标题：101串

---

解法：直接DFS暴搜跑一会就出来了。

代码：

import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;


public class Main {
    public static InputReader in = new InputReader(new BufferedInputStream(System.in));
    public static PrintWriter out = new PrintWriter(System.out);
    public static String s;
    public static long sum;

    public static void main(String[] args) {
        s = "";
        sum = 0;
        dfs(1, s);
        out.println(sum);
        out.flush();
        out.close();
    }

    static void dfs(int k, String str) {
        if (k > 30) {
            if (str.contains("101")) sum++;
            return;
        }
        for (int i = 0; i <= 1; i++) 
            dfs(k+1, str+i);
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public String nextLine() {
            String str = null;
            try {
                str = reader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public Double nextDouble() {
            return Double.parseDouble(next());
        }

        public BigInteger nextBigInteger() {
            return new BigInteger(next());
        }

    }
}

答案：1046810092