CDN加速镜像 | 设为首页 | 加入收藏夹
当前位置: 首页 资源下载 源码下载 数值算法/人工智能 搜索资源 - pta

搜索资源列表

  1. pta

    0下载:
  2. 正交频分复用基于IEEE802.11a的PTA跟踪法,同学自己编的,较复杂,运用了锁相环
  3. 所属分类:matlab例程

    • 发布日期:2008-10-13
    • 文件大小:893
    • 提供者:kongnan
  1. pta3

    21下载:
  2. 浙大 PTA练习系统数值分析NA1003 三角追赶法的应用-One day, CYLL found an interesting piece of commercial newspaper: the Cyber-restaurant was offering a kind of Lunch Special which was said that one could buy one get two for free . That is, if you buy one of the dish
  3. 所属分类:Algorithm

    • 发布日期:2017-04-29
    • 文件大小:107707
    • 提供者:qiuyingyue
  1. pta4

    16下载:
  2. 浙大PTA练习系统NA1004 比较雅各比迭代和高斯塞德尔迭代-Use Jacobi and Gauss-Seidel methods to solve a given n×n linear system A x ⃗ = b ⃗ with an initial approximation x ⃗ (0) . Note: When checking each a ii , first sca
  3. 所属分类:Algorithm

    • 发布日期:2017-04-30
    • 文件大小:110602
    • 提供者:qiuyingyue
  1. Connect-Set

    0下载:
  2. 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-06-图1 列出连通集 给定一个有NNN个顶点和EEE条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。-Given a free E N vertices and edges of the graph, please list the set of all of its communicat
  3. 所属分类:Data structs

    • 发布日期:2017-04-12
    • 文件大小:862
    • 提供者:zhangzhi
  1. Saving-James-Bond

    0下载:
  2. 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-06-图2 Saving James Bond - Easy Version 编译器-python2-This time let us consider the situation in the movie Live and Let Die in which James Bond, the world s most famous spy, was captured by a group of drug dealers. He
  3. 所属分类:Data structs

    • 发布日期:2017-04-12
    • 文件大小:726
    • 提供者:zhangzhi
  1. File-Transfer

    0下载:
  2. 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-05-树8 File Transfer 编译器:python2-We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer one computer to another. Is it possible to send a file any com
  3. 所属分类:Data structs

    • 发布日期:2017-04-12
    • 文件大小:926
    • 提供者:zhangzhi
  1. Root-of-AVL-Tree

    0下载:
  2. 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-04-树5 Root of AVL Tree 编译器:python2-An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than on
  3. 所属分类:Data structs

    • 发布日期:2017-04-13
    • 文件大小:1900
    • 提供者:zhangzhi
搜珍网 www.dssz.com