zoukankan      html  css  js  c++  java
  • HDOJ 1061 Rightmost Digit

    Rightmost Digit

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


    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
    234
     

    Sample Output
    76
    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.
     

    Author
    Ignatius.L

     #include<iostream>

    using namespace std;

    int main()
    {
        int n;
        cin>>n;
        for(int k=0;k<n;k++)
        {
            int m;
            cin>>m;
            int t=(m-1)%4;

            m=m%10;

            //cout<<t<<" "<<m<<endl;

            int l;
            switch(t)
            {
            case 0:
                l=m; break;
            case 1:
                l=m*m%10; break;
            case 2:
                l=m*m*m%10; break;
            case 3:
                l=m*m*m*m%10; break;
            }

            cout<<l<<endl;

        }
        return 0;
    }

  • 相关阅读:
    WPF 如何引入外部样式
    jQuery插件-json2.js
    前端js几种加密/解密方法
    asp.net Web项目中使用Log4Net进行错误日志记录
    UpdateProgress
    UpdatePanel的简单用法(非嵌套)
    UpdatePanel的用法详解
    asp.net调用前台js调用后台代码分享
    JVM中的运行参数
    为什么要对jvm进行优化
  • 原文地址:https://www.cnblogs.com/CKboss/p/3351101.html
Copyright © 2011-2022 走看看