- UID
- 1221751
- 在线时间
- 小时
- 注册时间
- 2016-7-14
- 最后登录
- 1970-1-1
- 主题
- 帖子
- 性别
- 保密
|
Ron的解释很好:
There are lots and lots of words in this problem. The first thing to do"”as in all CR problems"”is to simplify the situation into terms that a 10-year-old could follow.
Let's say there are two nominees, Darlene and Marlene.
According to these rules:
* Before Darlene can become a nominee, she has to be told that Marlene is a nominee.
* Before Marlene can become a nominee, she has to be told that Darlene is a nominee.
You can see why this is problematic. It's impossible.
So, C is also impossible, because you can't even have more than 1 nominee. If you are limited to 1 nominee, then "first" and "last" nominees have no meaning. |
|