linux环境下用c语言实现对GPS数据的读取和分析，图形界面用minigui实现，在redhat9.0系统中调试通过
上传时间： 2014-11-23
上传用户：努力努力再努力
有关linux下图形系统的详细介绍 包括qt，minigui等等图形库的介绍
上传时间： 2014-01-06
上传用户：xiaoxiang
这是我在工作中编写的针对helio板GUI接口 程序，用于minigui
上传时间： 2015-04-20
上传用户：CSUSheep
linu下开发的GIS程序，使用工具minigui
上传时间： 2013-12-23
上传用户：edisonfather
嵌入式系统图形用户界面编程，miniGUI的稳定版本，源代码是全部公开的
上传时间： 2015-04-22
上传用户：上善若水
深圳英培特EduKit-III实验箱实验程序。一共有10多个，包括ARM7,uClinux,MiniGUI相关的一些程序。
标签： EduKit-III 实验箱 实验 程序
上传时间： 2015-05-15
上传用户：TF2015
A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is.
标签： bit collection including addition
上传时间： 2015-05-17
上传用户：cursor
abel Tool Sample Requires: Visual Basic 6 and MapObjects 2.x Data: redlands.shp (Redlands sample data set from MO 2.x) Interactive Labeling Tool If the check box is checked, then the mouse down location will search for the closest line, and label it with the street name. If the check box is not checked, then the mouse down will turn into a pan/zoom tool. There is a slider bar to control the search tolerance in screen pixels for the labeling.
标签： MapObjects Requires Redlands redlands
上传时间： 2013-12-17
上传用户：sunjet
数字运算，判断一个数是否接近素数 A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum of its digits divides its value. Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not. Input Each line of input contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone. Output For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise. Sample Input 10 111 2 110 10 123 6 1000 8 2314 0 Sample Output yes yes no yes no
上传时间： 2015-05-21
上传用户：daguda
2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimum x exists, print a line with 2^x mod n = 1. Print 2^? mod n = 1 otherwise. You should replace x and n with specific numbers. Sample Input 2 5 Sample Output 2^? mod 2 = 1 2^4 mod 5 = 1
标签： mod satisfies minimum number
上传时间： 2015-06-02
上传用户：qlpqlq
