登录
首页 » Pascal » DXClass.pas

DXClass.pas

于 2022-02-03 发布 文件大小:3.66 kB
0 319
下载积分: 2 下载次数: 1

代码说明:

Abvcdnf jsdfsjg sgkhjyoei jsdhy jsgksj sjtsgjuse setuset sjetsjset jset setjsetstset siwtyekth ikrhnra rjnaryr 雷恩 jbdr bwef

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • WIP管理
    用在车间现场管理,实现车间工序库存及时耗用,有效的做好车间现场的盘点用业,此功能属于MES系统软件开发的一个功能模块,可以供做MES系统开发人员参考,开发工具用的是DELPHI2010。对做DELPHI开发的伙伴可以看看
    2022-06-29 12:16:57下载
    积分:1
  • hsl_save_05_07_14
    matlab music play!!!!!!!!!!!!!!!!!利用matlab做声音分析(matlab music play!!!!!!!!!!!!!!!!!)
    2009-11-20 22:34:57下载
    积分:1
  • 2
    Background Given a set of rectangles {R1, R2, …, Rn}, compute the area of their common intersection. i.e., Area(R1∩R2∩…∩Rn) The edges of the rectangles R1, R2, …, Rn, are either vertical or horizontal lines. For example, the intersection of 4 rectangles, R1, R2, R3, and R4, in the following figure is the shaded rectangle. Input The input contains (N + 1) lines. The first line specifies the number of rectangles N, where 1 < N < 1000. Since the sides of the rectangles are parallel to the x-axis and y-axis, each rectangle is bounded by the lines x = x1, x = x2, y = y1 and y = y2 and each subsequent line of the input file thus specifies one rectangle in the following format: x1 x2 y1 y2 such that 0 <= x1 < x2 <= 10000 and 0 <= y1 < y2 <= 10000, and x1, x2, y1 and y2 are integers. Output The output file contains the area of the intersection of all the rectangles.
    2013-11-15 02:58:38下载
    积分:1
  • Solution
    VNOI code primepath.pas dagiac.pas tour.pas qbbishop.pas
    2014-10-08 15:55:43下载
    积分:1
  • fpLCLSimple_3.2526
    Simple Lazarus Chromium Browser
    2018-11-19 23:02:58下载
    积分:1
  • RMATH
    MATH -- a unit of elementary mathematical routines for Turbo Pascal versions 4 up
    2017-12-21 11:49:12下载
    积分:1
  • Image Search
    用于在图像中搜索图像的库。使用归一化互相关(NCC)算法
    2023-04-30 18:05:03下载
    积分:1
  • BootTraps
    AVRco - Pascal Example Code
    2010-02-19 16:49:14下载
    积分:1
  • Graphtheory
    图论的算法书籍,书中包含许多经典的例子,入门用。 章节:1基本概念 2最短路径 3最小生成树 4图的连通性 5支配集与独立集 6网络流 7匹配 8着色 9可行遍性(Graph theory, algorithms books, the book contains many classic examples of entry to use. Chapters: a basic concept of two shortest path minimal spanning tree 4 Figure 3 connectivity of five dominating set and independent set of six matching network flow 7 of 8 coloring 9 viable over the)
    2009-12-03 21:34:03下载
    积分:1
  • jsoi2008a1
    2008年春季函授有关问题1 林厚从(Correspondence relating to the spring 2008 issue of 1 lam thick from the)
    2008-04-24 23:53:11下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载