由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
Programming版 - [合集] 问一道MS面试题 (转载)
相关主题
请教用R怎样实现一个binary tree的class对thinking in c++里这段代码没搞懂
请问大家一个eclipse CDT的问题 (转载)boost 1.49.0 有 heap 了
What happens when recursion functions are declared inline?Looks like 王垠 was right about Google culture
[合集] How to detect if a number is a fibonacci number? (转载)FMP 一个完整可运行的范例程序
An interview question关于c++的效率再给个例子
[合集] huge map怎么算最短路径?Perl程序员工作机会多吗?
看看这个题吧brainbench上的ccompare double to float
Help needed on coding for Fibonacci seriesC的问题,困惑中
相关话题的讨论汇总
话题: fibonacci话题: 10010话题: 10话题: ms话题: written
进入Programming版参与讨论
1 (共1页)
b***y
发帖数: 2799
1
☆─────────────────────────────────────☆
helpme (范坚强) 于 (Mon Mar 10 11:52:52 2008) 提到:
发信人: pumpkin2009 (南瓜), 信区: JobHunting
标 题: 问一道MS面试题
发信站: BBS 未名空间站 (Mon Mar 10 04:49:16 2008)
If the Fibonacci series is 1,2,3,5,8,13,..... then 10 can be written as 8 +
2 ==> 10010 and 17 can be written as 13 + 3 + 1 ==> 100101. Got it??
The Question was, given n, I need to get all possible representations of n
in Fibonacci Binary Number System.
as 10 = 8 + 2 ==> 10010
also 10 = 5 + 3 + 2 ==> 1110
☆─────
1 (共1页)
进入Programming版参与讨论
相关主题
C的问题,困惑中An interview question
如何把'101111' 转化成二进制数101111[合集] huge map怎么算最短路径?
how to seperate representation and concepts看看这个题吧brainbench上的c
json能取代xml么??????Help needed on coding for Fibonacci series
请教用R怎样实现一个binary tree的class对thinking in c++里这段代码没搞懂
请问大家一个eclipse CDT的问题 (转载)boost 1.49.0 有 heap 了
What happens when recursion functions are declared inline?Looks like 王垠 was right about Google culture
[合集] How to detect if a number is a fibonacci number? (转载)FMP 一个完整可运行的范例程序
相关话题的讨论汇总
话题: fibonacci话题: 10010话题: 10话题: ms话题: written