ACM試題Problem K:Ones
Description
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?
1.功能
用全選主元高斯消去法計算矩陣A的秩(C語言)
2.函數(shù)參數(shù)說明
double a[m][n] : 存放mxn階矩陣A的元素,返回時將被破壞
int m : 矩陣A的行數(shù)
int n : 矩陣A的列數(shù)
int rank() : 函數(shù)返回A的秩
3.文件說明
rank.c為函數(shù)程序
rank0.c為主函數(shù)程序
VTS(VisuaI Test Shelf) V3.4.7的源代碼。VTS是美國國家聯(lián)邦實驗室N.I.S.T.所開發(fā)的BACnet協(xié)議下的報文的測試工具。BACnet(A Data Communication Protocol for
Building Automation and Control Network)是由美國采暖、制冷和空調(diào)工程師協(xié)會制定的開放樓宇自動控制網(wǎng)絡(luò)數(shù)據(jù)通信協(xié)議。