Time
Limit: 2000/1000 MS (Java/Others) Memory Limit:
65536/32768 K (Java/Others)
Total Submission(s):
29108 Accepted Submission(s):
11115
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31 |
import java.util.Scanner; public class Main { /** * @param args */ public
static void main(String[] args) { // TODO Auto-generated method stub Scanner s = new
Scanner(System.in); int
t = s.nextInt(); for ( int
i= 0 ; i<t; i++){ int
n=s.nextInt(); int [][] a ={ { 0 },{ 1 },{ 6 , 2 , 4 , 8 }, { 1 , 3 , 9 , 7 }, { 6 , 4 }, { 5 }, { 6 }, { 1 , 7 , 9 , 3 }, { 6 , 8 , 4 , 2 }, { 1 , 9 } }; int [] l = { 1 , 1 , 4 , 4 , 2 , 1 , 1 , 4 , 4 , 2 }; int
d = n% 10 ; System.out.println(a[d][n%l[d]]); } } } |
原文:http://www.cnblogs.com/ramanujan/p/3587349.html