 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:750000 is enough... simple maths, just program to calculate the minimum n that a[n]=a[n+1]=1(mod 10^5)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 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
