IUT Inter University Programming Contest 2012



The things you should know:
  • Scroll down to see the Problemset.
  • 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
Click here to get everything
Serial, Title & PDF link  Problemsetter
(A) Association of Strings  Kazi Rakibul Hossain
(B) Binary Substring  Sohel Hossain Kabir
(C) Common Palindrome  Anindya Das
(D) Draw and Score  Moshiur Rahman
(E) Elliptic Athletics Track  Mir Wasi Ahmed
(F) Fun with Binary Tree  Abu Obaida Opu
(G) Good Measures of Dispersion  Anindya Das
(H) Hardest Problem Ever (Easy) A. O. Opu, T. I. Sunny
(I ) Interesting Route   Shiplu Hawlader
(J) Just Some Permutations  Tasnim Imran Sunny
(K) K-Neutral Rectangles  Shiplu Hawlader

- ACM Valladolid On-line Judge team