文件名称:Looking-for-Palindrome-made-several
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:614byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
寻找并输出11~999之间的数m,它满足m、m的平方、m的立方均为回文数。所谓回文数是指其各位数字左右对称的整数,例如121、676、94249等。满足上述条件的数如 m=11,其平方为121,其立方为1331,皆为回文数。要求编制函数 int svalue(long m)实现此功能,如果是回文数,则函数返回1,反之则返回0。在主函数中将三重回文数输出。-Looking for and output 11 ~ 999 between several m, it satisfies m, m square, m cubic palindromes are counted. The number of reported is to show its all digital symmetric integer, such as 121, 676, 94249,, etc. Meet the conditions mentioned above several such as m = 11, the square for 121, its cubic for 1331, all for palindromes number. Requirements of function int svalue (long m) to implement this function, if number is reported, the function returns 1, conversely return zero. In the main function will triple palindromes several output.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Read me.txt
找回文数.txt
找回文数.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.