hdu-1061 Rightmost Digit

標籤：problem   hint   size   test   --   題目   水題   cond   ota   

題目連結：

http://acm.hdu.edu.cn/showproblem.php?pid=1061

題目類型：

水題

題意概括：

求n的n次方的個位元。

解題思路：

因為N的範圍太大，所以我通過對位元為1-9的數進行20次次方打表，發現他們的迴圈節不是4，就是4的因子，所以我對位元為1-9進行打表四次，然後對輸入的數只判斷個位元，然後判斷這個數在第幾迴圈節並輸出即可。

題目：

Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 55914    Accepted Submission(s): 21129

Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N. 

 

InputThe input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single positive integer N(1<=N<=1,000,000,000). 

 

OutputFor each test case, you should output the rightmost digit of N^N. 

 

Sample Input234 

 

Sample Output76  HintIn the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7.In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6. 

# include <stdio.h># include <string.h>int main (){    int i,j,t,n,x,y;    int a[10][10];    memset(a,0,sizeof(a));    for(i=1;i<10;i++)    {        a[i][1]=i;        for(j=2;j<5;j++)        {            a[i][j]=a[i][j-1]*i%10;        }        a[i][0]=a[i][4];     }     scanf("%d",&t);     while(t--)     {         scanf("%d",&n);         x=n%10;         y=n%4;         printf("%d\n",a[x][y]);     }} 

 

hdu-1061 Rightmost Digit