2379. Best Compression Ever

单点时限: 2.0 sec

内存限制: 256 MB

Being educated in Computer Science and Mathematics is not always easy. Especially not if you have “friends” who repeatedly insist on showing you their new “proofs” that P equals NP, that the Riemann Hypothesis is true, and so on.

One of your friends recently claims to have found a fantastic new compression algorithm. As an example of its amazing performance, your friend has told you that every file in your precious collection of random bit strings after compression would be at most b bits long! Naturally, you find this a bit hard to believe, so you want to determine whether it is even theoretically possible for this to be true.

Your collection of random bit strings consists of N files, no two of which are identical, and each of which is exactly 1000 bits long.

输入格式

The input consists of two integers N (1 ≤N ≤1015) and b (0 ≤b ≤50), giving the number of fi les in your collection and the maximum number of bits a compressed fi le is allowed to have.

输出格式

Output a line containing either “yes” if it is possible to compress all the N files in your collection into files of size at most b bits, or “no” otherwise.

样例

Input
13 3
/*
1 0
31415926535897 40
*/
Output
yes
/*
yes
no
*/

20 人解决,26 人已尝试。

29 份提交通过,共有 107 份提交。

4.9 EMB 奖励。

创建: 13 年,7 月前.

修改: 4 年,9 月前.

最后提交: 1 年,2 月前.

来源: NCPC 2008

题目标签