摘要：
You are given the sequence of all K-digit binary numbers: 0, 1,..., 2K-1. You need to fully partition the sequence into M chunks. Each chunk must be a 阅读全文
摘要：
Let's consider the 32 bit representation of all integers i from m up to n inclusive (m ≤ i ≤ n; m × n ≥ 0, -2^31 ≤ m ≤ n ≤ 2^31-1). Note that a negati 阅读全文
摘要：
Description Create a code to determine the amount of integers, lying in the set [ X; Y] and being a sum of exactly K different integer degrees ofB. Ex 阅读全文
摘要：
Description windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。 windy想知道，在A和B之间，包括A和B，总共有多少个windy数？ Input 包含两个整数，A B。 Output 一个整数。 Sample Input 【输入样例一】 阅读全文
摘要：
Problem Description A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided 阅读全文