- sfolders Find files on drives FAST using wildcards within search criteria. Easy and fully customizable. Just drop the component on the form
- Buoyancy algorithm used in Tomb Raider. The algorithm is suited for polyhedra on flat water surfaces.
- ASP_55xx Schematic Diagram for Acer Aspire
- TestTrueOrFalse 判断一个透镜（凹透镜
- fo-dicom-master 功能强大的dicom开源代码..好用
- studentManagement 用链表写的 学生信息管理系统
文件名称:haiye
-
所属分类：
- 标签属性：
- 上传时间：2012-11-16
-
文件大小：903byte
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
池塘里有n片荷叶（1≤n≤1000），它们正好形成一个凸多边形。按照顺时针方向将这n片荷叶顺次编号为1，2，…，n。
有一只小青蛙站在1号荷叶上，它想跳过每片荷叶一次且仅一次（它可以从所站的荷叶跳到任意一片荷叶上）。同时，它又希望跳过的总距离最短-Pond, the n tablets lotus leaf (1 ≤ n ≤ 1000), they just form a convex polygon. These n piece lotus leaf sequential number according to the clockwise direction as 1,2, ..., n.
A little frog standing on a lotus leaf on the 1st, it would like to skip every piece of lotus leaf once and only once (it can jump from the station of the lotus leaf to any one on a lotus leaf). At the same time, it would like to skip the shortest total distance
有一只小青蛙站在1号荷叶上，它想跳过每片荷叶一次且仅一次（它可以从所站的荷叶跳到任意一片荷叶上）。同时，它又希望跳过的总距离最短-Pond, the n tablets lotus leaf (1 ≤ n ≤ 1000), they just form a convex polygon. These n piece lotus leaf sequential number according to the clockwise direction as 1,2, ..., n.
A little frog standing on a lotus leaf on the 1st, it would like to skip every piece of lotus leaf once and only once (it can jump from the station of the lotus leaf to any one on a lotus leaf). At the same time, it would like to skip the shortest total distance
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建 文本文档.txt
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。