nike0good |Oier&ACMer | 熟能生巧

Problem Statement   Rabbits often feel hungry, so when they go out to eat carrots, they jump as quickly as possible. Initially, rabbit Hanako stands at position init. From position x, she

B. Pasha and String time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Pasha got a very beautiful string s for

题目1 : 01串 时间限制:7000ms 单点时限:1000ms 内存限制:256MB 描述 给定两个整数n和m，求是否存在恰好包含n个0和m个1的01串S，使得S中不存在子串"001"和"11"。 如果存在符合条件的01串则输出字典序最小的S，否则输出NO。 输入 一行两个整数，表示n和m。(0 输出 一行一个字符串，为字典序