數(shù)字運算，判斷一個數(shù)是否接近素數(shù) 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
源代碼\用動態(tài)規(guī)劃算法計算序列關(guān)系個數(shù) 用關(guān)系"<"和"="將3個數(shù)a，b，c依次序排列時，有13種不同的序列關(guān)系： 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個數(shù)依序列，設(shè)計一個動態(tài)規(guī)劃算法，計算出有多少種不同的序列關(guān)系， 要求算法只占用O(n),只耗時O(n*n).
標簽： lt 源代碼 動態(tài)規(guī)劃 序列
上傳時間： 2013-12-26
上傳用戶：siguazgb
c語言版的多項式曲線擬合。 用最小二乘法進行曲線擬合. 用p－1 次多項式進行擬合，p<= 10 x,y 的第0個域x[0],y[0],沒有用，有效數(shù)據(jù)從x[1],y[1] 開始 nNodeNum,有效數(shù)據(jù)節(jié)點的個數(shù)。 b,為輸出的多項式系數(shù)，b[i] 為b[i-1]次項。b[0],沒有用。 b,有10個元素ok。
上傳時間： 2014-01-12
上傳用戶：變形金剛
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
用游標的方法實現(xiàn)對稱差的計算，即 （A-B）+（B-A）
上傳時間： 2016-05-23
上傳用戶：遠遠ssad
詞法分析器 對輸入一個函數(shù)，并對其分析main() { int a,b a = 10 b = a + 20 }
上傳時間： 2013-12-20
上傳用戶：hfmm633
基因算法，用VC++或MATLAB，java等工具設(shè)計一程序計算任一個隨機產(chǎn)生的DNA基因表達式的有效長度和值 設(shè)隨機產(chǎn)生的基因表達式為： + Q - / b * b a Q b a a b a a b b a a a b
上傳時間： 2014-01-09
上傳用戶：aa54
函數(shù)再現(xiàn)機構(gòu)設(shè)計 試設(shè)計一曲柄搖桿機構(gòu)，再現(xiàn)函數(shù) 要求： 輸入構(gòu)件的轉(zhuǎn)角范圍180°，輸出構(gòu)件擺角范圍30°，即： 當輸入構(gòu)件從a轉(zhuǎn)至a+90時，輸出構(gòu)件從b轉(zhuǎn)至b+30 當輸入構(gòu)件從a+90轉(zhuǎn)至a+180時，輸出構(gòu)件從b+30轉(zhuǎn)至b
上傳時間： 2013-12-17
上傳用戶：英雄
這個連接池是直接從JIVE中取出來的，進行了一下修改，使得連接參數(shù)直接在程序中設(shè)定而不是從屬性文件中讀取。 [b]用法：[/b] 先設(shè)定自己的連接參數(shù)，在DbConnectionDefaultPool.java文件的loadProperties方法中。注意你也需要設(shè)定連接池的log文件的存放位置。
上傳時間： 2016-11-21
上傳用戶：TF2015
漢諾塔?。?！ Simulate the movement of the Towers of Hanoi puzzle Bonus is possible for using animation eg. if n = 2 A→B A→C B→C if n = 3 A→C A→B C→B A→C B→A B→C A→C
標簽： the animation Simulate movement
上傳時間： 2017-02-11
上傳用戶：waizhang
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
