ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1028
. Stars
Accepted 0.015 sec
Posted by
super vladutz
14 Jun 2005 00:20
Hint: 2^(least signifacnt bit of n) = n^( n & (n-1) )
Re: Accepted 0.015 sec
Posted by
Samsonov Alex [USU]
1 Sep 2005 16:43
Accepted 0.015 sec using n*log n algorithm!
© 2000–2024
Timus Online Judge Team
. All rights reserved.