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:75000 is enough... simple maths, just program to calculate the minimum n that a[n]=a[n+1]=1(mod 10^5)

Posted by fjnu_jxd_010 at 2006-01-24 17:45:13 on Problem 2748
In Reply To:75000 is enough... simple maths, just program to calculate the minimum n that a[n]=a[n+1]=1(mod 10^5) Posted by:richardhuang at 2006-01-24 00:13:33
but can you proof it by math?

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