文件名称:code
- 所属分类:
- 其他小程序
- 资源属性:
- [Windows] [Visual.Net] [源码]
- 上传时间:
- 2015-04-19
- 文件大小:
- 1.88mb
- 下载次数:
- 1次
- 提 供 者:
- zhangs******
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
binary tree asm lab1-In computer science, binary tree is a widely used data structure. Here we will look at infinite binary tree where the node is a pair of integers. The tree is constructed as follows:
1. The root is the pair (1,1).
2. If a node is (a,b) then its left child is (a+b,b) and its right child (a,a+b)
Given the pair (a,b) of some node of the binary tree descibed above, suppose you are traversing the root of the tree to the given node along the shortest possible path. Can you find out the times you have to go to a left child and the times to a right child.
Input: The first line contains the number of input sets, each of which is consisted of a single line containing two integers i and j ( 1<=i,j<=2*10^9) that represent a node (i,j). You can assume that this is a valid node in the binary tree described above.
1. The root is the pair (1,1).
2. If a node is (a,b) then its left child is (a+b,b) and its right child (a,a+b)
Given the pair (a,b) of some node of the binary tree descibed above, suppose you are traversing the root of the tree to the given node along the shortest possible path. Can you find out the times you have to go to a left child and the times to a right child.
Input: The first line contains the number of input sets, each of which is consisted of a single line containing two integers i and j ( 1<=i,j<=2*10^9) that represent a node (i,j). You can assume that this is a valid node in the binary tree described above.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
code
test1\file.raw
.....\lena512.raw
.....\trans.c
.....\trans.exe
.....\trans.o
.....\trans.obj
....2\Debug\CL.read.1.tlog
.....\.....\CL.write.1.tlog
.....\.....\link-cvtres.read.1.tlog
.....\.....\link-cvtres.write.1.tlog
.....\.....\link.51096-cvtres.read.1.tlog
.....\.....\link.51096-cvtres.write.1.tlog
.....\.....\link.51096.read.1.tlog
.....\.....\link.51096.write.1.tlog
.....\.....\link.read.1.tlog
.....\.....\link.write.1.tlog
.....\.....\mt.read.1.tlog
.....\.....\mt.write.1.tlog
.....\.....\rc.read.1.tlog
.....\.....\rc.write.1.tlog
.....\.....\test2.exe
.....\.....\test2.exe.embed.manifest
.....\.....\test2.exe.embed.manifest.res
.....\.....\test2.exe.intermediate.manifest
.....\.....\test2.ilk
.....\.....\test2.lastbuildstate
.....\.....\test2.log
.....\.....\test2.pdb
.....\.....\test2_manifest.rc
.....\.....\trans2.obj
.....\.....\vc100.idb
.....\.....\vc100.pdb
.....\file.raw
.....\ipch\test2-7d47d04b\test2-aaf1d2be.ipch
.....\kernel32.pdb\17D8B8C647E14C1DAF9C6FC206AAAC512\download.error
.....\lena512.raw
.....\test2.sdf
.....\test2.sln
.....\test2.suo
.....\test2.vcxproj
.....\test2.vcxproj.filters
.....\test2.vcxproj.user
.....\trans2.c
.....\trans2.exe
.....\trans2.o
.....\trans2.obj
....3\file.raw
.....\lena512.raw
.....\trans3.c
.....\trans3.exe
.....\trans3.o
.....\trans3.obj
....4\file.raw
.....\lena512.raw
.....\trans2.exe
.....\trans2.o
.....\trans2.obj
.....\trans4.c
.....\trans4.exe
.....\trans4.obj
....2\ipch\test2-7d47d04b
.....\kernel32.pdb\17D8B8C647E14C1DAF9C6FC206AAAC512
.....\Debug
.....\ipch
.....\kernel32.pdb
test1
test2
test3
test4