hdu 1061 Rightmost Digit

暴力解决不了问题，有规律可循， 只需看末尾数字即可， 末尾数字的 n 次方是有规律的


#include<cstdio>
using namespace std; int main(){ int n; int t; while(scanf("%d",&t) != EOF){ while(t--){
            scanf("%d", &n); if(n%10 == 0) printf("0\n"); else if(n%10 == 1) printf("1\n"); else if(n%10 == 2){ if(n%4 == 0) printf("6\n"); else printf("4\n"); } else if(n%10 == 3){ if((((n/10)%10)%2) == 0) printf("7\n"); else printf("3\n"); } else if(n%10 == 4) printf("6\n"); else if(n%10 == 5) printf("5\n"); else if(n%10 == 6) printf("6\n"); else if(n%10 == 7) { if((((n/10)%10)%2) == 0) printf("3\n"); else printf("7\n"); } else if(n%10 == 8){ if((((n/10)%10)%2) == 0) printf("6\n"); else printf("4\n"); } else if(n%10 == 9) printf("9\n"); } } return 0; }