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
1846
. GCD 2010
Simpler solution
Posted by
Takanashi Rikka
23 Feb 2016 20:00
I solved this problem by map for keeping count of numbers and dynamic segment tree.
Is there any simpler solution that don't use data structures.
© 2000–2024
Timus Online Judge Team
. All rights reserved.