Elics的博客

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 sing

假设： S1 = 1 S2 = 12 S3 = 123 S4 = 1234 … S9 = 123456789 S10 = 1234567891 S11 = 12345678912 … S18 = 123456789123456789 … 现在我们把所有的串连接起来 S = 1121231234…123456789123456789112345678912… 那么你能告诉我在S串中的第N个数字是多少吗？ Input 输入首先是一个数字K，代表有K次询问。 接下来的K行每行有一个整数N(1 <= N &l