搜索资源列表
SQL2000bao
- int getDivisor(int iNum) { int i = 1 int sum = 0 if (0 == iNum) { return 1 } while (i <= iNum / 2) { if (0 == iNum % i) { sum++ } i++ } return (sum+1) } -int getDivisor (int iNum) (int i = 1
cppfrance_SOMME-DEUX-MATRICES-CARREES___Page
- calcul the sum of two matrice
stl-Summary
- 对STl的常用函数就像总结,方便查找- STl of commonly used functions like sum up, easy to find