![]() | ||||
Online Judge | Problem Set | Authors | Online Contests | User |
---|---|---|---|---|
Web Board Home Page F.A.Qs Announcement | Current Contest Past Contests Scheduled Contests Award Contest |
Ridiculous Addition Time Limit:1000MS Memory Limit:65536K
Let us write down the infinite consecutive integers in a sequence in
one line without any space and their squares in the second line. This
will generate two different long numbers, now we want to find the sum
of these two numbers. The calculation of the first 30 digits is just as
below.
![]() The first digit of the result is 2, the second digit is 7, and the third is 2 and so on. Given an integer k, you should output the digit at position k in the resulting number. Input The input file will contain
several test cases. In each of the test cases, there is an integer k (0
< k <= 2 ^ 31 - 1) in one line.
For each test case you should generate a line of output, which is the digit in the k-th place of the addition result. Sample Input
POJ Monthly--2005.07.31, BlessAladdin |
[Submit] [Go Back] [Status] [Discuss]
All Copyright Reserved 2003-2005 Ying Fuchen,Xu Pengcheng
Any problem, Please Contact Administrator