May 2009 - May 2017 论坛八周年-你的足迹,我的骄傲



查看: 1301|回复: 2


[复制链接] |试试Instant~ |关注本帖
tank_z 发表于 2016-10-29 11:28:59 | 显示全部楼层 |阅读模式

2016(10-12月) 码农类 硕士 其他@Google - Other - 在线笔试 |Other其他


您需要 登录 才可以下载或查看,没有帐号?获取更多干活,快来注册

某日在谷歌搜索蹦出了个彩蛋叫, 进去后让我做题有木有, 吓得我一愣一愣的。然后蹦出来这么一道题完全不知道怎么做。感觉像马尔科夫转移矩阵求stable state, 但是不会编啊 而且最后返回要求还是分数形式。。。 想了好久看是不是能用graph来做也不会。。。求问各位大神有没有思路。。
Making fuel for the LAMBCHOP's reactor core is a tricky process because of the exotic matter involved. It starts as raw ore, then during processing, begins randomly changing between forms, eventually reaching a stable form. There may be multiple stable forms that a sample could ultimately reach, not all of which are useful as fuel.

Commander Lambda has tasked you to help the scientists increase fuel creation efficiency by predicting the end state of a given ore sample. You have carefully studied the different structures that the ore can take and which transitions it undergoes. It appears that, while random, the probability of each structure transforming is fixed. That is, each time the ore is in 1 state, it has the same probabilities of entering the next state (which might be the same state).  You have recorded the observed transitions in a matrix. The others in the lab have hypothesized more exotic forms that the ore can become, but you haven't seen all of them.

Write a function answer(m) that takes an array of array of nonnegative ints representing how many times that state has gone to the next state and return an array of ints for each terminal state giving the exact probabilities of each terminal state, represented as the numerator for each state, then the denominator for all of them at the end and in simplest form. The matrix is at most 10 by 10. It is guaranteed that no matter which state the ore is in, there is a path from that state to a terminal state. That is, the processing will always eventually end in a stable state. The ore starts in state 0. The denominator will fit within a signed 32-bit integer during the calculation, as long as the fraction is simplified regularly.
. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
For example, consider the matrix m:
  [0,1,0,0,0,1],  # s0, the initial state, goes to s1 and s5 with equal probability
  [4,0,0,3,2,0],  # s1 can become s0, s3, or s4, but with different probabilities
  [0,0,0,0,0,0],  # s2 is terminal, and unreachable (never observed in practice)
  [0,0,0,0,0,0],  # s3 is terminal
  [0,0,0,0,0,0],  # s4 is terminal
  [0,0,0,0,0,0],  # s5 is terminal
So, we can consider different paths to terminal states, such as:
s0 -> s1 -> s3
s0 -> s1 -> s0 -> s1 -> s0 -> s1 -> s4
s0 -> s1 -> s0 -> s5
Tracing the probabilities of each, we find that
s2 has probability 0
s3 has probability 3/14
s4 has probability 1/7
s5 has probability 9/14
So, putting that together, and making a common denominator, gives an answer in the form of
[s2.numerator, s3.numerator, s4.numerator, s5.numerator, denominator] which is
[0, 3, 2, 9, 14].
. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴


weiwinn 发表于 2016-11-4 11:26:05 | 显示全部楼层
回复 支持 反对

使用道具 举报

 楼主| tank_z 发表于 2016-11-4 11:50:01 | 显示全部楼层
做不出来 放弃了
回复 支持 反对

使用道具 举报



一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明 ( 沪ICP备11015994号 )

custom counter

GMT+8, 2017-5-28 18:52

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表