本软件是为南开大学体育部开发的,作为跆拳道比赛分组,分级别的小工具.在程序中导入Excel格式的文件,文件中是比赛运动员的相关信息.按设置场地要求自动生成比赛对阵图(word格式)和对阵表(Excel格式). 本项目是在Visual Studio 2005上开发,应用了OFFICE.NET技术.
上传时间： 2014-12-06
上传用户：CHENKAI
针对机器人比赛和电子设计竞赛中机器人寻线行走的普遍要求，提出了一种通用的寻线行走机器人的设计方法。机器人的核心控制器包括实现控制算法的DSP和用于扩展功能实现的CPLD；对来自光电检测传感器的信号采用模糊控制规则进行综合，核心控制器根据模糊控制器输出调整机器人的行走路线，最终实现机器人寻线行走。
上传时间： 2016-04-15
上传用户：ardager
北京大学ACM比赛题 The game of Scrabble is played with tiles. A tile either has a single letter written on it, or it is blank. In the latter case, the tile may be used to represent a letter of your choice. On your turn, you arrange the tiles to form a word. Each tile may be used at most once, but not all tiles need to be used. Given several Scrabble tiles and a dictionary, determine how many words in the dictionary can be formed using the given Scrabble tiles.
标签： Scrabble written either letter
上传时间： 2016-04-22
上传用户：dancnc
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
标签： mathematician Christian Goldbach Leonhard
上传时间： 2016-04-22
上传用户：wangchong
北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries.
标签： the Consider infinite numbers
上传时间： 2013-12-16
上传用户：日光微澜
北京大学ACM比赛题目 Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.
标签： CAPITAL LETTERS program Write
上传时间： 2014-01-17
上传用户：410805624
知能车源码,CCD采样道路,飞思卡尔智能车比赛源码.
上传时间： 2016-04-22
上传用户：Ants
这个是参加飞思卡尔只能小车比赛的程序，大家可以作为参考
上传时间： 2013-12-09
上传用户：小码农lz
飞思卡尔比赛智能车控制主程序. 基于CCD路径识别来控制智能车循迹.
上传时间： 2016-05-03
上传用户：Miyuki
机器人足球AI设计比赛，东南大学队伍的源代码。代码覆盖了机器人比赛中的基本技术问题，参考价值很大。
标签： 机器人
上传时间： 2016-05-11
上传用户：manking0408
