福大计算机期末考模拟题(Fu Da computer final exam mock problem).doc

福大计算机期末考模拟题(Fu Da computer final exam mock problem).doc

  1. 1、本文档共19页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
福大计算机期末考模拟题(Fu Da computer final exam mock problem)

福大计算机期末考模拟题(Fu Da computer final exam mock problem) 1. Pac Man Pac man is a very classic game in which players control beans, eat all beans on the map, and avoid being caught by monsters. No monster this problem, the game screen is divided into M*N lattice, each lattice may be open or terrain obstacles, pac man can move on the ground, every time a mobile 1s pac man, and only up and down about four direction, especially the pac man can spit out the tongue, tongue every move one time only need 0.1s, the tongue can walk straight. You dont have to think about the time it takes for a bean man to turn around. For example, in the Pac Man (1,1) coordinates, and beans in (1,5) coordinates, and no obstacle, the direction toward the tongue beans, after 0.8s can eat beans (and the 0.4s, spit out the tongue to back.). In the game also has the acceleration prop, once obtains the acceleration prop, eats bean people to obtain 2 times to move the speed, spits the tongue the speed not to increase, namely walks 1 squares, uses 0.5s. Theres only one bean on the map now. The game there. On behalf of the vacant land; X said obstacles, pac man cannot cross the barrier; B represents beans; S represents accelerated props, props and map a total of not more than 1 items, location space, use immediately get the props, the props disappear immediately, terrain becomes empty, can not be used to get the tongue P said the props; pac man, when the tongue of pac man cannot move. Enter data (use standard input and output, not read and write files) Enter the first line with two integers n, m (2=n, m=20), followed by a n*m map matrix. For 50% of the data, there are no props on the map. Output data (use standard input and output, not read and write files) Output a line, the fastest how much s to eat beans, and then retain 1 decimal places, if not, the output -1. Sample input and output Example 1: Input output 22 XP B. One point two Example 2: Input output 32 XP .S B. 1.7 The state [] [] [] submit the ret

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档