It's as simple as one,two ,three…

Feynman写过一篇文章“It's as simple as one,two ,three……”在这篇文章里他讨论了“思考”这个问题。

大概是在11、12岁的时候,Feyman和小伙伴Bernie说,思考不过是自己和自己的对话。但Bernie反问道:“你知道汽车的连轴曲杆长什么样吗?”“当然知道”“那么你怎么和你自己描述连轴曲杆长什么样?”于是,Feyman意识到,思考也可以是视觉性的。

然后在Feynman读大学的时候受到一篇心理学文章的启发,突然想知道人对时间的感知与什么因素有关。

作为物理系的Feynman很快就设计出了实验。 第一步,安静的呆在房间里数数,从1数到60,看看花了多长时间。48s,嗯,没有问题,虽然快了点但只要有个稳定的水平就够了。后面又测了几次;47、48、49、48、48…… 第二步,开始改变变量。 第一个有关因素是心跳:Feynman开始在楼梯上跑,跑的越多心跳就越快,跑一段以后他又回房间数数,从1数到60。竟然还是48s,试了几次以后(一直跑上跑下,他同学像看傻子一样的看着他,他还不能解释,一说话就不能好好数数了),他发现他对时间的感知与心跳无关。同时,他还排除了体温的因素。(他知道运动对体温的提高并不多)。事实上他看不出在物理上有什么能改变他的数数速度。他可以一边叠T恤一边数数,可以一边叠袜子一边数数(袜子好像还不够数)。 第二个因素是阅读:他一边读书一边数数,他一边读报一边数数,他一边抄书一边数数。大多没有影响,直到有一次他抄着抄着突然忘了一个单词怎么写,然后啊,那次他数到60花了60s. 他总结道:当一件事需要更多的“脑力”的时候,人对时间的感知就会变慢。一个人不能在数数的同时和别人大声说话。

第二天早饭的时候,他向同桌公布了他的实验和结论。 室友John不信,并提出了他的质疑:他不信Feynman能一边看书一边数数,同时他认为一边说话一边数数是完全可以的。 于是,他们两个就摆了个擂台比了一把。 规则:Feynman先一边读书一边数数,数到60就喊停,大家看一下时间后再听他讲这本书的内容。而John则讲一个故事,同时数到60就停。 补充规则:先测出John数数的稳定水平。 结果是:Feynman和John都完成了挑战。他们一起讨论了一下。Feynam的数数,像是有个声音在数一样,所以Feynman数数时能看书但不能讲话;而John的数数,像是眼前有数字在动一样,所以John能在数数的时候讲话,但不能看书。最后,他们把结论改成了“一个人不能在数数的同时大声读书。”以符合他们两个的情况。

这件事,让Feynman意识到,每个人思考的方式都是不一样的,概念在你的脑海中呈现的方式也各个不同。特别是他在上课的时候,他会想到——我看到这个方程的时候,方程里的字符都是有颜色的,我讲这个方程的时候它会变成鲜艳的图画。那么我的学生们会看到怎么样的一幅场景?

转载于:https://my.oschina.net/u/3304023/blog/1620400

Robert is a famous engineer. One day he was given a task by his boss. The background of the task was the following: Given a map consisting of square blocks. There were three kinds of blocks: Wall, Grass, and Empty. His boss wanted to place as many robots as possible in the map. Each robot held a laser weapon which could shoot to four directions (north, east, south, west) simultaneously. A robot had to stay at the block where it was initially placed all the time and to keep firing all the time. The laser beams certainly could pass the grid of Grass, but could not pass the grid of Wall. A robot could only be placed in an Empty block. Surely the boss would not want to see one robot hurting another. In other words, two robots must not be placed in one line (horizontally or vertically) unless there is a Wall between them. Now that you are such a smart programmer and one of Robert's best friends, He is asking you to help him solving this problem. That is, given the description of a map, compute the maximum number of robots that can be placed in the map. Input The first line contains an integer T (<= 11) which is the number of test cases. For each test case, the first line contains two integers m and n (1<= m, n <=50) which are the row and column sizes of the map. Then m lines follow, each contains n characters of '#', '', or 'o' which represent Wall, Grass, and Empty, respectively. Output For each test case, first output the case number in one line, in the format: "Case :id" where id is the test case number, counting from 1. In the second line just output the maximum number of robots that can be placed in that map.
06-06
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值