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

其实很容易

Posted by BBTiger at 2010-07-27 16:54:42 on Problem 1189
假设2^51个球落下,模拟下落,O(n*n)的复杂度,得到那个m的位置有几个球,之后求一下最大公倍数就行,0ms
注意一下m那里没有球的时候要特判

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