SPOJ Problem 3442:The last digit
2015-03-04 20:47
316 查看
求某数的某次幂最后一位,暴力找规律后取模。
#include<cstdio> #include<cstring> int t,x,y,s; int a[20]; int main(){ scanf("%d",&t); while(t--){ scanf("%d%d",&x,&y); s=2;x%=10; a[0]=1;a[1]=x;a[2]=x*x%10; while(a[s]!=x)a[++s]=a[s-1]*x%10; if (y==0)printf("1\n");else{ y=(y-1)%(s-1)+1; printf("%d\n",a[y]); } } }
相关文章推荐
- SPOJ Problem 5699:The last digit re-visited
- POJ 1150 The Last Non-zero Digit 阶乘最后非0位
- The last non-zero digit in N![hdu-1066]
- POJ1150_The Last Non-zero Digit_阶乘性质
- poj 1150 The Last Non-zero Digit(阶乘取模运算的简单性质及递归技巧)
- pku 1150 The Last Non-zero Digit 阶乘最后一位非零数
- poj 1150:The Last Non-zero Digit(求A(n, m)的最后一个非0位)
- (Relax 数论1.27)POJ 1150 The Last Non-zero Digit(求p(n,m)的最后一个非零数字)
- POJ 1150 The Last Non-zero Digit 数论+容斥
- Solving the Last Item Problem for a Circular Distribution with Partially Overlapping Items
- POJ 1150-The Last Non-zero Digit(求阶乘最后一位非零数)
- SPOJ 18249 IITWPC4F - Gopu and the Grid Problem(线段树)
- poj 1150 The Last Non-zero Digit 求排列数的最后非零数
- The last digit
- POJ 1150 The Last Non-zero Digit 已翻译
- Zoj 3541 The Last Puzzle (dp) - 2011 ACM-ICPC Dalian Regional Contest Problem C
- SPOJ Problem 11063:AP - Complete The Series (Easy)
- uva 10212 - The Last Non-zero Digit.
- 洛谷 1601 A+B Problem(高精)(The Last Problem In MY Winter Holiday,the Thirtieth)
- TOJ 10007 The last non-zero digit of n!