沪深4107 A1
CSI4107 A1 (2024-02-11, Java, 0KB, 下载0次)
[https: github.com xiaohaibin PageMenuLayout,由于这位大佬的开源的首页分页导航菜单功能写的是很好,但是让我们去集成他的依赖时,如果是使用androidx版本的话,基本是用不了,所有我就直接把他用到相关类重新引用了一些,修改成了适用...](https: github.com xiaohaibin PageMenuLayout%EF%BC%8C%E7%94%B1%E4%BA%8E%E8%BF%99%E4%BD%8D%E5%A4%A7%E4%BD%AC%E7%9A%84%E5%BC%80%E6%BA%90%E7%9A%84%E9%A6%96%E9%A1%B5%E5%88%86%E9%A1%B5%E5%AF%BC%E8%88%AA%E8%8F%9C%E5%8D%95%E5%8A%9F%E8%83%BD%E5%86%99%E7%9A%84%E6%98%AF%E5%BE%88%E5%A5%BD%EF%BC%8C%E4%BD%86%E6%98%AF%E8%AE%A9%E6%88%91%E4%BB%AC%E5%8E%BB%E9%9B%86%E6%88%90
[https: github.com xiaohaibin PageMenuLayout, because the big guy s open-source homepage paging navigation menu function is well written, but when we integrate his dependencies, if we use the androidx version, it is basically useless, so I directly use it to the relevant classes, re quote some, and modify it to be applicable...] (https: github.com xiaohaibin PageMenuLayout% EF% BC% 8C% E7% 94% B1% E4% BA% 8E% E8% BF% 99% E4% BD% 8D% E5% A4% A7% E4% BD% AC% E7% 9A% 84% E5% BC% 80% E6% BA% 90% E7% 9A% 84% E9% A6% 96% E9% A1% B5% E5% 88% 86% E9% A1% B5% E5% AF% BC% E8% 88% AA% E8% 8F% 9C% E5% 8D% 95% E5% 8A% 9F% E8% 83% BD% E5% 86% 99% E7% 9A% 84% E6% 98% AF% E5% BE% 88% E5% A5% BD% EF% BC% 8C% E4% BD% 86% E6% 98% AF% E8% AE% A9% E6% 88% 91% E4% BB% AC% E5% 8E% BB% E9% 9B% 86% E6% 88% 90 (2020-07-02, Java, 0KB, 下载0次)
[http: hencoder.com ui-1-1 自定义View直方图和饼图的练习](http: hencoder.com ui-1-1 %E8%87%AA%E5%AE%9A%E4%B9%89View%E7%9B%B4%E6%96%B9%E5%9B%BE%E5%92%8C%E9%A5%BC%E5%9B%BE%E7%9A%84%E7%BB%83%E4%B9%A0),
[http: hencoder.com ui-1-1 Custom View Histogram and Pie Chart Exercise] (http: hencoder.com ui-1-1% E8% 87% AA% E5% AE% 9A% E4% B9% 89View% E7% 9B% B4% E6% 96% B9% E5% 9B% BE% E5% 92% 8C% E9% A5% BC% E5% 9B% BE% E7% 9A% 84% E7% BB% 83% E4% B9% A0), (2017-10-24, Java, 0KB, 下载0次)
usb摄像头使用示例,原项目地址:[https: github.com jiangdongguo AndroidUSBCamera,common库地址:https: github.com saki4510t libcommon](https: github.com jiangdongguo AndroidUSBCamera%EF%BC%8Ccommon%E5%BA%93%E5%9C%B0%E5%9D%80%EF%BC%9Ahttps: github.com saki4510t libcommon),
Example of using USB camera, original project address: [https: github.com jiangdongguo AndroidUSBCamera, common library address: https: github.com saki4510t libcommon] (https: github.com jiangdongguo AndroidUSBCamera% EF% BC% 8Ccommon% E5% BA% 93% E5% 9C% B0% E5% 9D% 80% EF% BC% 9Ahttps: github.com saki4510t libcommon), (2020-12-17, Java, 0KB, 下载0次)
微软365 e5扩展，，
microsoft 365 e5 extension,, (2023-09-14, Java, 0KB, 下载0次)
БибаиотекаобеГонааниен。，
Библиотека общего назначения., (2023-07-22, Java, 0KB, 下载0次)
xggfhytjtykyukyutdytj
Guidelime_ShikuCNSpeedyAutoLoot-2.0.24-classic (2020-12-24, Java, 932KB, 下载0次)
功能小程序，很方便做到翼型的升阻力系数的气动计算和结构优化
xfoil Small function program, it is very convenient to achieve the aerodynamic calculation of airfoil lift resistance coefficient and structural optimization (2019-03-13, Java, 3879KB, 下载6次)
Given N rational numbers in the form "numerator/denominator", you are supposed to calculate their sum.
输入描述:
Each input file contains one test case. Each case starts with a positive integer N (<=100), followed in the next line N rational numbers "a1/b1 a2/b2 ..." where all the numerators and denominators are in the range of "long int". If there is a negative number, then the sign must appear in front of the numerator.
输出描述:
For each test case, output the sum in the simplest form "integer numerator/denominator" where "integer" is the integer part of the sum, "numerator" < "denominator", and the numerator and the denominator have no common factor. You must output only the fractional part if the integer part is 0.
Input Description:
Each input file contains one test case. Each case starts with a positive integer N (<=100), followed in the next line N rational numbers "a1/b1 a2/b2 ..." where all the numerators and denominators are in the range of "long int". If there is a negative number, then the sign must appear in front of the numerator.
Output Description:
For each test case, output the sum in the simplest form "integer numerator/denominator" where "integer" is the integer part of the sum, "numerator" < "denominator", and the numerator and the denominator have no common factor. You must output only the fractional part if the integer part is 0. (2019-03-02, Java, 3KB, 下载1次)
关于ST7701S+CTC3.97TN的测试程序，可以调试
About ST7701S+CTC3.97TN test program, you can debug. (2018-09-19, Java, 3KB, 下载54次)
DLT645-2007多功能电能表通信协议调试器2012-02-07发行
DLT645-2007 multi-function power meter communication protocol debugger 2012-02-07 issue (2018-07-31, Java, 1578KB, 下载2次)
问题一：设a[0:n-1]是已排好序的数组。请改写二分搜索算法，使得当搜索元素x不在数组中时，返回小于x的最大元素位置i和大于x的最小元素位置j，当搜索元素在数组中时，i和j相同，均为x在数组中的位置。
问题二：采用分治策略实现对n个元素进行排序的合并排序算法，其基本思想是：将待排序元素分成大小大致相同的2个子集合，分别对2个子集合进行排序，最终将排好序的子集合合并成为所要求的排好序的集合。
问题三：给定n个矩阵{A1，A2，A3，……，An}，其中，Ai与Ai+1是可乘的，i=1，2，…,n-1。要求用动态规划解矩阵连乘积的最优计算次序问题。
该三题的算法设计思想及源码，调试结果
Question one: Let a [0: n-1] is already sorted array. Please rewrite the binary search algorithm so that when the search element of x is not an array, the return is less than x, is larger than the largest element in position i and position x, the smallest element of j, when the search elements in the array when, i and j the same, both x in the array position.
Problem 2: The strategy for achieving the partition of n elements to sort of merge sort algorithm, whose basic idea is: sort elements are to be divided into roughly the same size of the two sub-sets, respectively, of the two sub-sort the collection will eventually sorted The merged to form the required subset sorted collection.
Question 3: Given n matrices (A1, A2, A3, ... ..., An), where, Ai and Ai+1 is a mere a, i = 1,2, ..., n-1. Required to use dynamic programming solution matrix with the optimal product sequence calculation of the problem.
The three questions of the algorithm design ideas and source code, debu (2009-11-12, Java, 9KB, 下载11次)