欧几里德算法：辗转求余 原理: gcd(a,b)=gcd(b,a mod b) 当b为0时,两数的最大公约数即为a getchar()会接受前一个scanf的回车符
上传时间： 2014-01-10
上传用户：2467478207
数据结构课程设计 数据结构B+树 B+ tree Library
上传时间： 2013-12-31
上传用户：semi1981
The purpose of this application note is to show an example of how a digital potentiometer can be used in thefeedback loop of a step-up DC-DC converter to provide calibration and/or adjustment of the output voltage.The example circuit uses a MAX5025 step-up DC-DC converter (capable of generating up to 36V,120mWmax) in conjunction with a DS1845, 256 position, NV digital potentiometer. For this example, the desiredoutput voltage is 32V, which is generated from an input supply of 5V. The output voltage can be adjusted in35mV increments (near 32V) and span a range wide enough to account for resistance, potentiometer and DCDCconverter tolerances (27.6V to 36.7V).
上传时间： 2014-12-23
上传用户：781354052
Altium Designer常用器件集成库PCB封装库原理图库3D库元件库集成库原理图器件型号列表：76个13W3 2N7002 74HC0474HC0874HC244D74HC595 74LS138 80508550 8P4R_0603ADM2582EADM3053AS5145B AT24C02BAT54SBUZZ BatteryCCT6806CD4001CD4053CapacitorDS18B20Diode Diode SchottkyFP6101FT2232DFUSEHMC5883LINA118IR2010IR2101SIR2136SIRF1010EIRFP7404ISO7240InductorLEDLF444LG9110SLM339LM393LMV7239MAX232MCP2551MCP6022MCP6024MPU6050Mic2941Micro SD CardMicro USBNuMicro-M051OPTOISOIPESDxS2UATPT2272PVI1050PhonejackResistanceSN65VHD230STC12LE5202STM32F103CBT6STM32F103RBT6STM32F103VCT6STM32F407VSwitchTJA1050TLV5638ITMS320F28035PAGTMS320F28035PNTOP242U18UC3854ULN2803USB A-BVBUS Xtal 集成库PCB封装列表：76个8P4R_060313W30805DBC04-BBT_CR1220BUZZC0201C0402C0603C0805C1206CD127CPX-32CRYSTALD1206DC-0003DC-0005DIP-4DIP-6DIP-8DO-201ADDO-214AADO-214ABDO-214ACF5mmFUSEFUSE_001FUSE_LFUSE2HC-49/U-SHDRX3L-330uHLCC-24NLPCC-16NLQFP-48LQFP-64LQFP-80Micro SD CardMicro USBR0201R0402R0603R0805R1206R1210R2512SDRH5D18-220NSIP-3SMD CRYSTALSMD-8SOIC-4SOIC-8SOIC-14SOIC-16SOIC-16WSOIC-18SOIC-20SOIC-24SOIC-28SOT-23SOT23-5SOT23-6SWSwitch1TD-19XATO-92TO-92ATO-220-2TO-220ATO-220BTO-247ACTO-263-5TQFP-100TSSOP-16USB DIPUSB-A
标签： altium designer pcb
上传时间： 2022-02-12
上传用户：tqsun2008
The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition
标签： government streamline important alphabet
上传时间： 2015-06-08
上传用户：weixiao99
* 高斯列主元素消去法求解矩阵方程AX=B,其中A是N*N的矩阵,B是N*M矩阵 * 输入: n----方阵A的行数 * a----矩阵A * m----矩阵B的列数 * b----矩阵B * 输出: det----矩阵A的行列式值 * a----A消元后的上三角矩阵 * b----矩阵方程的解X
上传时间： 2015-07-25
上传用户：xauthu
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2013-12-31
上传用户：lhc9102
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-16
上传用户：jeffery
(1) 、用下述两条具体规则和规则形式实现.设大写字母表示魔王语言的词汇 小写字母表示人的语言词汇 希腊字母表示可以用大写字母或小写字母代换的变量.魔王语言可含人的词汇. (2) 、B→tAdA A→sae (3) 、将魔王语言B(ehnxgz)B解释成人的语言.每个字母对应下列的语言.
上传时间： 2013-12-30
上传用户：ayfeixiao
1.有三根杆子A,B,C。A杆上有若干碟子 2.每次移动一块碟子,小的只能叠在大的上面 3.把所有碟子从A杆全部移到C杆上 经过研究发现，汉诺塔的破解很简单，就是按照移动规则向一个方向移动金片： 如3阶汉诺塔的移动：A→C,A→B,C→B,A→C,B→A,B→C,A→C 此外，汉诺塔问题也是程序设计中的经典递归问题
上传时间： 2016-07-25
上传用户：gxrui1991
