zoukankan      html  css  js  c++  java
  • HDU1061:Rightmost Digit

    Problem Description
    Given a positive integer N, you should output the most right digit of N^N.
     
    Input
    The 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).
     
    Output
    For each test case, you should output the rightmost digit of N^N.
     
    Sample Input
    2 3 4
     
    Sample Output
    7 6
    Hint
    In 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.
     


     

    //这道题与HDU1097题基本就是一样的

    只需要稍微改一下就可以了

    #include <stdio.h>
    #include<string.h>
    int main()
    {
        int a,b,n,t;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d",&a);
            n=a%10;
            b = a;
            if(b==0)
                printf("1\n");
            else
            {
                switch(n)
                {
                case 0:
                case 1:
                case 6:
                    break;
                case 2:
                    n=b%4;
                    switch(n)
                    {
                    case 1:
                        n=2;
                        break;
                    case 2:
                        n=4;
                        break;
                    case 3:
                        n=8;
                        break;
                    case 0:
                        n=6;
                        break;
                    }
                    break;
                case 3:
                    n=b%4;
                    switch(n)
                    {
                    case 1:
                        n=3;
                        break;
                    case 2:
                        n=9;
                        break;
                    case 3:
                        n=7;
                        break;
                    case 0:
                        n=1;
                        break;
                    }
                    break;
                case 4:
                    n=b%2;
                    switch(n)
                    {
                    case 1:
                        n=4;
                        break;
                    case 0:
                        n=6;
                        break;
                    }
                    break;
                case 7:
                    n=b%4;
                    switch(n)
                    {
                    case 1:
                        n=7;
                        break;
                    case 2:
                        n=9;
                        break;
                    case 3:
                        n=3;
                        break;
                    case 0:
                        n=1;
                        break;
                    }
                    break;
                case 8:
                    n=b%4;
                    switch(n)
                    {
                    case 1:
                        n=8;
                        break;
                    case 2:
                        n=4;
                        break;
                    case 3:
                        n=2;
                        break;
                    case 0:
                        n=6;
                        break;
                    }
                    break;
                case 9:
                    n=b%2;
                    switch(n)
                    {
                    case 1:
                        n=9;
                        break;
                    case 0:
                        n=1;
                        break;
                    }
                    break;
                }
            }
            printf("%d\n",n);
        }
        return 0;
    }
    
    


     

  • 相关阅读:
    docker常用命令
    2020/10/10,饮食男女-对教条主义的补充和现实的摸索
    2020/08/24,约束力
    2020/08/21,迷茫的时候就去工作
    2020/08/21,神秘和平易近人
    2020/08/21,圣人和教条
    2020/07/21,翡翠梦境
    2020/10/10,生活不是阶段式跳跃的,是螺旋式的。
    2020/07/23,再论point,way,moment,time
    2020/07/13,旅游的意义是什么
  • 原文地址:https://www.cnblogs.com/javawebsoa/p/2999598.html
Copyright © 2011-2022 走看看