The ++Y2K++ World Final Warm-up Contest.


The things you should know:
  • Scroll down to see the Problemset.
  • Judge is a Pentium 4, 2.8GH
  • If you have trouble viewing HTML, view the PDF files.
  • For all problems assume pi=2*acos(0) or pi=2*cos_inverse(0).
  • The Contest duration may be increased for our mistakes or to give people more Time to Practice.
  • To send clarification send mail to clarify@acm.uva.es
  • The Clarification replies will be given via email. But it may also be put in the Clarification Board if it is of general interest.
  • Please look at the Clarification Board for any correction notice.
    •
The Problemset
Serial, Title & HTML link PDF File Link Problemsetter
(A) Convex Orthogonal Polygon PDF for A Shahriar Manzoor
(B) Spanning Subtree PDF for B Mohammad Mahmudur Rahman
(C) Optimal Segments PDF for C Sohel Hafiz
(D) Triangle and Polynomial PDF for D Shahriar Manzoor
(E) Masud Rana PDF for E Md. Arifuzzaman Arif
(F) Avoiding Overlaps PDF for F Md. Arifuzzaman Arif
(G) SMS for Blind PDF for G Shahriar Manzoor
(H) Its all about the Bandwidth PDF for H Igor Naverniouk
(I) General Sultan PDF for I Mohammad Mahmudur Rahman
Click here to get the entire HTML Problemset
Click here to get the entire PDF Problemset

- ACM Valladolid On-line Judge team

For any comments, suggestions please mail to contest@acm.uva.es.