Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:how to find righmost and leftmost K( >=1 ) digit in n^m

Posted by Icco at 2009-03-08 19:58:17
In Reply To:how to find righmost and leftmost K( >=1 ) digit in n^m Posted by:Icco at 2009-03-08 15:37:45 
> rt, i apologize if some one has already asked this question. :)
比如2的10000000次方如何知道转化成10进制后，最后100位都是什么？
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator