搜索资源列表
phan mem hay
- huong dan phan mem hay nhat
ChonSu
- 已知一颗有根树是 2-tree(只有度为2和度为0的结点),并且有n个叶子节点,从左到右编号为1,2,…, n,还知道两个相邻编号节点之间的 ChonSu(这棵树中这链接这两个节点的路径的边数)。求任意两个叶子节点x, y (1≤x≤n)之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-l
peditLISP
- peditLISP.rar : (defun c:nn() (princ "\n Chon doi tuong : ") (setq ss (ssget)) (command "PEDIT" "m" ss "" "y" "J" "" "") (princ) )-peditLISP.rar : (defun c:nn() (princ "\n Chon doi tuong : ")
L-Chuong-5---Cac-giao-thuc-chon-duong
- Chư ơ ng 5: Mạ ng Máy Tính Đ ạ i Họ c Bách Khoa Hà Nộ i
Phan mem Tinh chon cap
- phan mem tinh chon cap