PCB LAYOUT技術大全---初學者必看！
PROTEL相關疑問
1.原理圖常見錯誤：
（1）ERC報告管腳沒有接入信號：
a. 創建封裝時給管腳定義了I/O屬性;
b.創建元件或放置元件時修改了不一致的grid屬性,管腳與線沒有連上;
c. 創建元件時pin方向反向,必須非pin name端連線。
（2）元件跑到圖紙界外：沒有在元件庫圖表紙中心創建元件。
（3）創建的工程文件網絡表只能部分調入pcb：生成netlist時沒有選擇為global。
（4）當使用自己創建的多部分組成的元件時,千萬不要使用annotate.
2.PCB中常見錯誤：
（1）網絡載入時報告NODE沒有找到：
a. 原理圖中的元件使用了pcb庫中沒有的封裝;
b. 原理圖中的元件使用了pcb庫中名稱不一致的封裝;
c. 原理圖中的元件使用了pcb庫中pin number不一致的封裝。如三極管：sch中pin number 為e,b,c, 而pcb中為1,2,3。
USB Manager(usbmgr) 0.4.8 Shuu Yamaguchi <shuu@wondernetworkresources.com> Special Helper: Philipp Thomas When USB devices connect to or disconnect from a USB hub, the usbmgr works as the following according to configuration. a) It loads and unloads files Linux kernel modules. b) It execute file to setup USB devices.
數字運算，判斷一個數是否接近素數
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
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.
