搜索资源列表
KMLCreator
- KML 2.0介绍 KML全称是Keyhole Markup Language KML，是一个基于XML语法和文件格式的文件，用来描述和保存地理信息如点、线、图片、折线并在Google Earth客户端之中显示 The core of the project is the KMLCreator.cs. This has three classes, KMLCoordinates, KMLPoint and KMLLine-Google Earth KML File Creator C
john
- 约瑟夫环问题，参考严蔚敏版数据结构，只含源码，无报告请见谅-Joseph
109
- small c compiler by john mp cd-sdfadf
kdtree_cpp_warpper
- 实现对John Tsiombikas的C语言版的kdtree算法的C++封装，实现了最近邻查询已经指定距离搜索。复杂度NLOG(N),非常快。-A c++ wrapper of John Tsiombikas s library for working with 2d/3d kd-trees
TheBoredomDivTwo
- topcoder 698 题目 John and Brus are bored. They have n+m common friends. The first n of them are bored and other m are not. John chooses the j-th (1-based) friend for a talk. If the friend is not bored, he becomes bored after the talk. Brus does the sa
4
- 构造一个结构体链表,每个结点存储学生信息(如学号和姓名), 如(001, 张三),(002, 李四), 要求输入001,能找出相对的名字.即输入001,输出张三.-Construct a linked list structure, each node storing student information (such as student number and name), such as (001, Joe Smith), (002, John Doe), requiring the in
1234
- 1.字符数据变为整型数据 2.计算矩阵的秩 3.输入一个循环链表,每个结点存一些东西,比如存int 数字, 即构造链表, Node1(存数字3)->Node2(6)-> Node3->Node4->Node1, 然后输入一个位置,比如1, 定位到Node2,从Node2开始每隔三个Node删除一个Node,直到该链表删除完. 4. 构造一个结构体链表,每个结点存储学生信息(如学号和姓名), 如(001, 张三),(002, 李四), 要求输入001,能找
john
- 约瑟夫环文题描述：已知n个人围坐圆桌周围。从编号k的人开始报数，数到m的那个人出列；他的下一个人有1开始报数，数到m的那个人呢出列，一次规律重复下去-Joseph ring title descr iption: n known individuals sitting around the table.People began to count off number k, count to m out the man He has 1 started to count off the next
POJ3273
- POJ3273 Monthly Expense题解 题目分析： 给出N个数，要求你合并连续的数，使其合并在满足不差过M个合并后的集合的时候，不超过M个集合的和的最大值最小。-Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amo