ARM-Linux开机自启动设置-ok6410开发板
For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yeilds 3, a single digit and also the digital root of 39.
The Eddy‘s easy problem is that : give you the n,want you to find the n^n‘s digital Roots.
2 4 0
4 4
看FFT看的头晕还是没看懂,然后回头刷水题,想找点快感,没想到碰到个小炸弹。。。
用到了一个九余数定理,不知道这个定理确实很难做……
九余数定理简介:一个数N 各位数字的和 对9 取余等于 这个数对 9取余。。
太坑了,记下来,免得以后忘了……
**********************/
#include <iostream> #include <stdio.h> using namespace std; int main() { int n,i,s; while(scanf("%d",&n)&&n) { s = 1; for(i = 1;i<=n;i++){ s=s*n%9; } if(s==0) printf("9\n"); else printf("%d\n",s); } return 0; }
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。