溫度華氏轉變攝氏 #include <stdio.h> #include <stdlib.h> enum x {A,B,C,D,E} int main(void) { int a=73,b=85,c=66 { if (a>=90) printf("a=A等級!!\n") else if (a>=80) printf("73分=B等級!!\n") else if (a>=70) printf("73分=C等級!!\n") else if (a>=60) printf("73分=D等級!!\n") else if (a<60) printf("73分=E等級!!\n") } { if (b>=90) printf("b=A等級!!\n") else if (b>=80) printf("85分=B等級!!\n") else if (b>=70) printf("85分=C等級!!\n") else if (b>=60) printf("85分=D等級!!\n") else if (b<60) printf("85分=E等級!!\n") } { if (c>=90) printf("c=A等級!!\n") else if (c>=80) printf("66分=B等級!!\n") else if (c>=70) printf("66分=C等級!!\n") else if (c>=60) printf("66分=D等級!!\n") else if (c<60) printf("66分=E等級!!\n") } system("pause") return 0 }
上传时间： 2014-11-10
上传用户：wpwpwlxwlx
溫度華氏轉變攝氏 #include <stdio.h> #include <stdlib.h> enum x {A,B,C,D,E} int main(void) { int a=73,b=85,c=66 { if (a>=90) printf("a=A等級!!\n") else if (a>=80) printf("73分=B等級!!\n") else if (a>=70) printf("73分=C等級!!\n") else if (a>=60) printf("73分=D等級!!\n") else if (a<60) printf("73分=E等級!!\n") } { if (b>=90) printf("b=A等級!!\n") else if (b>=80) printf("85分=B等級!!\n") else if (b>=70) printf("85分=C等級!!\n") else if (b>=60) printf("85分=D等級!!\n") else if (b<60) printf("85分=E等級!!\n") } { if (c>=90) printf("c=A等級!!\n") else if (c>=80) printf("66分=B等級!!\n") else if (c>=70) printf("66分=C等級!!\n") else if (c>=60) printf("66分=D等級!!\n") else if (c<60) printf("66分=E等級!!\n") } system("pause") return 0 }
上传时间： 2013-12-12
上传用户：亚亚娟娟123
function g=distance_classify(A,b) 距离判别法程序。 输入已分类样本A（元胞数组），输入待分类样本b 输出待分类样本b的类别g 注：一般还应计算回代误差yita 输入已知分类样本的总类别数n 每类作为元胞数组的一列
标签： distance_classify function 判别 分类
上传时间： 2013-11-25
上传用户：yyyyyyyyyy
1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A). 2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci number.
标签： dimensions arbitrary function reverse
上传时间： 2016-04-16
上传用户：waitingfy
The Original USB 2.0 specification released on April 27, 2000 Errata to the USB 2.0 specification as of December 7, 2000 Mini-B connector Engineering Change Notice to the USB 2.0 specification. Pull-up/pull-down Resistors Engineering Change Notice to the USB 2.0 specification. Errata to the USB 2.0 specification as of May 28, 2002 Interface Association Descriptor Engineering Change Notice to the USB 2.0 specification. Rounded Chamfer Engineering Change Notice to the USB 2.0 specification as of October 8, 2003 Unicode Engineering Change Notice to the USB 2.0 specification as of February 21, 2005 Inter-Chip USB Supplement Revision 1.0 as of March 13, 2006 Revision 1.3 of the USB On-The-Go Supplement as of December 5, 2006 Revision 1.01 of the Micro-USB Cables and Connectors Specification as of April 4, 2007 USB 2.0 Link Power Management Addendum Engineering Change Notice to the USB 2.0 specification as of July 16, 2007.
标签： specification 2.0 USB Original
上传时间： 2013-12-31
上传用户：familiarsmile
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
设计了一种基于两片AVR单片机的交通诱导屏显示单元控制系统，该系统由通信模块、显示控制模块和开关模块3部分组成。单片机A用于以RS-485的通信方式接收数据和应答主机，把处理好的数据发送到I/O口并写入EEPROM中，再通知单片机B读取数据。单片机B接收到数据后控制LED显示，通过调节驱动LED电流占空比的方式调节LED的亮度。给出了控制系统的硬件和软件设计方案。
上传时间： 2013-10-13
上传用户：wenyuoo
利用桶排序给数组a排序，建立的桶为b和e，其中b为含有十万个桶，e为只有一个链表的桶，然后对b和e使用插入算法排序，比较两种算法的时间，b需要40毫秒左右，e需要9到10分钟。
上传时间： 2014-01-02
上传用户：13681659100
源代码\用动态规划算法计算序列关系个数 用关系"<"和"="将3个数a，b，c依次序排列时，有13种不同的序列关系： a=b=c,a=b<c,a<b=v,a<b<c,a<c<b a=c<b,b<a=c,b<a<c,b<c<a,b=c<a c<a=b,c<a<b,c<b<a 若要将n个数依序列，设计一个动态规划算法，计算出有多少种不同的序列关系， 要求算法只占用O(n),只耗时O(n*n).
上传时间： 2013-12-26
上传用户：siguazgb
LCS（最长公共子序列）问题可以简单地描述如下： 一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。例如，若X={A，B，C，B，D，B，A}，Y={B，D，C，A，B，A}，则序列{B，C，A}是X和Y的一个公共子序列，但它不是X和Y的一个最长公共子序列。序列{B，C，B，A}也是X和Y的一个公共子序列，它的长度为4，而且它是X和Y的一个最长公共子序列，因为X和Y没有长度大于4的公共子序列。 最长公共子序列问题就是给定两个序列X={x1,x2,...xm}和Y={y1,y2,...yn}，找出X和Y的一个最长公共子序列。对于这个问题比较容易想到的算法是穷举，对X的所有子序列，检查它是否也是Y的子序列，从而确定它是否为X和Y的公共子序列，并且在检查过程中记录最长的公共子序列。X的所有子序列都检查过后即可求出X和Y的最长公共子序列。X的每个子序列相应于下标集{1,2,...,m}的一个子集。因此，共有2^m个不同子序列，从而穷举搜索法需要指数时间。
上传时间： 2015-06-09
上传用户：气温达上千万的
