搜索资源列表
两个ATLCOM组件源代码参考例子
- 这两个代码例子是本人在最近复习 com 时所写，主要是参考 Tom Armstrong, Ron Patton的ATL Developer s Guide,2nd Edition，希望不要笑话。以后本人写一些精彩片断，这次权当开场白吧-two code example is the recent review I wrote when com, the main reference Tom Armstrong, Ron Patton o
Figure_Models
- James Armstrong VHDL Design , source code
阿姆斯特朗数
- 如果一个正整数等于其各个数字的立方和，则称该数为阿姆斯特朗数(亦称为自恋性数)。 如 407=43+03+73就是一个阿姆斯特朗数。试编程求1000以内的所有阿姆斯特朗数-if one is integral to its various figures and Cubic, says the number of Armstrong (also known as narcissistic sexual numbers). If 40
mathcoding
- Ｃ语言数学编程：包括叠代整除，阿姆斯特朗数，完数，乘法矩阵，多位阶乘，四分砝码等算法-C Programming Language Mathematics : iterative divisible including Armstrong, a few, several End, matrix multiplication, many factorial quarters algorithms such as weight
armstrong
- 一个N位数的各位数的N次方之和等于这个数，称为armstrong数（如：153=1^3+5^3+3^3)。编一个程序，求出2，3，4位数中所有的armstrong数。-an N to the median number of Nth power equal to the sum of the number called armstrong (such as : 153 = a ^ ^ 3 5 3 3 ^ 3). Procedures f
fast
- 这是Armstrong的机器学习FAST算法matlab源代码，是从作者个人主页上下的，可以运行
阿姆斯特朗数
- 如果一个正整数等于其各个数字的立方和，则称该数为阿姆斯特朗数(亦称为自恋性数)。 如 407=43+03+73就是一个阿姆斯特朗数。试编程求1000以内的所有阿姆斯特朗数-if one is integral to its various figures and Cubic, says the number of Armstrong (also known as narcissistic sexual numbers). If 40
armstrong
- 一个N位数的各位数的N次方之和等于这个数，称为armstrong数（如：153=1^3+5^3+3^3)。编一个程序，求出2，3，4位数中所有的armstrong数。-an N to the median number of Nth power equal to the sum of the number called armstrong (such as : 153 = a ^ ^ 3 5 3 3 ^ 3). Procedures f
fast
- 这是Armstrong的机器学习FAST算法matlab源代码，是从作者个人主页上下的，可以运行-This is Armstrong s Machine Learning FAST algorithm matlab source code from the author of the personal home page from top to bottom, you can run
armstrong
- armstrong progam in java.this program explain for armstrong numbers
armstrong
- This a program to check whether the entered number is an armstrong number or not. An armstrong number can be defined as follows: e.g. number=153 then, cube(1)=1 cube(5)=125 and cube(3)=27 AND 1+125+27=153.
Armstrong
- 在三位的整数中，例如153可以满足13 + 53 + 33 = 153，这样的数称之为Armstrong数，试写出一程式找出所有的三位数Armstrong数。 -In the three integers, such as 153 to meet the 13+ 53+ 33 = 153, this number is called Armstrong numbers, try to write a program to ident
Armstrong-number
- 如果一个正整数等于其各位数字的n次方和，则称该数为阿姆斯特朗数。求出1000以内的阿姆斯特朗数是C语言的经典题目。-If a positive integer equal to the sum of its every figure s n-th power, we call the number Armstrong number.Finding out all the Armstrong numbers in 1000 is a cl
Algorithm-to-generate-armstrong-numbers
- Algorithm to generate armstrong numbers
armstrong
- 一个N位数的各位数的N次方之和等于这个数，称为armstrong数（如：153=1^3+5^3+3^3)。编一个程序，求出2，3，4位数中所有的armstrong数。-an N to the median number of Nth power equal to the sum of the number called armstrong (such as : 153 = a ^ ^ 3 5 3 3 ^ 3). Procedures f
Armstrong-number-c-program-
- Armstrong number c program: c programming code to check whether a number is armstrong or not. A number is armstrong if the sum of cubes of individual digits of a number is equal to the number itself. For example 371 is a
armstrong
- 一个N位数的各位数的N次方之和等于这个数，称为armstrong数（如：153=1^3+5^3+3^3)。编一个程序，求出2，3，4位数中所有的armstrong数。-an N to the median number of Nth power equal to the sum of the number called armstrong (such as : 153 = a ^ ^ 3 5 3 3 ^ 3). Procedures f
Armstrong-number
- 阿姆斯特朗数 可采用穷举法，依次取1000以内的各数(设为i)，将i的各位数字分解后，据阿姆斯特朗数的性质进行计算和判断。-Armstrong number can be brute-force method, the number of 1000 in order to take within each (set i), i of the digits after the decomposition, according to t
Armstrong
- 在三位的整数中，例如153可以满足13 + 53 + 33 = 153，这样的数称之为Armstrong数，试写出一程式找出所有的三位数Armstrong数。-In the three integers, such as 153 to meet the 13+ 53+ 33 = 153, this number is called Armstrong numbers, try to write a program to identify
Armstrong
- C++ code to check whether the input number is an armstrong number or not.