knowledgediarybd.com

Your Virtual Knowledge Campus







Introduction of ACM ICPC and UVa Online Judge

Dear, learner  in this tutorial you can know details about acm ICPC or ACM ICPC and UVa Online Judge

ACM-ICPC stands for(ACM International Collegiate Programming Contest) is an annual multi-tiered computer programming competition among the universities of the world.

Who Organized it ?

The contest is sponsored by IBM. Headquartered at Baylor University, with autonomous regions on six continents, the ICPC is directed by

Baylor Professor William B. Poucher, Executive Director, and operates under the auspices of the Association for Computing Machinery (ACM).

Major rules of Contest:

1.The ICPC is a team competition. Current rules stipulate that each team consist of three students. Participants must be university students, who have had less than five years of university education before the contest. Students who have previously competed in two World Finals or five regional competitions are ineligible to compete again.

2. During contest, the teams are given 5 hours to solve between 8 and 12 programming problems (with 8 typical for regionals and 10 for finals). They must submit solutions as programs in CC++Java, or C#. Programs are then run on test data. If a program fails to give a correct answer, the team is notified about that and they can submit another program.
3.The winner is the team which correctly solves most problems. If necessary to rank teams for medals or prizes among tying teams, the placement of teams is determined by the sum of the elapsed times at each point that they submitted correct solutions plus 20 minutes for each rejected submission of a problem ultimately solved.

4. For example, consider a situation when two teams, X and Y, tie by solving two problems each. The team X submitted their solutions to A and B at 1:00 and 2:45 after the beginning of the contest. They had a rejected run on C, but it was ignored since they didn’t solve C. The team Y submitted solutions to problems A and C at 1:20 and 2:00 after the beginning. They had one rejected run on C. Then, the total time is 1:00+2:45=3:45 for team X and 1:20+2:00+0:20=3:40 for team Y. The tie is broken in favor of Team Y.
5. Compared to other programming contests (for example, International Olympiad in Informatics), the ICPC is characterized by a large number of problems (8 or more problems in just 5 hours). Another feature is that each team can use only one computer, although teams have three students. This makes the time pressure even greater. Good teamwork and ability to withstand pressure is needed to win.

Regionals and World finals Rules :

1.The contest consists of several stages. Many universities hold local contests to determine participants at the regional level. Then, universities compete in Regional contests. Winners of Regional contests advance to the ACM-ICPC World Finals. More than one team from a university can compete in regionals, but only one may compete at the world finals. From each region, at least one team goes to World Finals. Regions with large number of teams send multiple teams to finals (sometimes as many as 16 teams from onevery large region).

2. No participant can take part in more than two World Finals.

3. Some large regions also hold Sub regional competitions (also called Preliminaries) which are intermediate between local and regional contests.

4. In ACM/ICPC, the result has seven different expressions (AC, WA, RTE, TLE, PE, MLE, CE).The result AC means the code is accepted by the system.

Dear Learner here,i give  some essential programming contest site & resources. I hope these will be more helpful for your better performance:

Note:More interested things are waiting to publish..Stay connected to us..

——————-:Thank you:—————–

Related Post or You may felt Interest:

  1. Programming Sites & Resources
  2. Introduction & Ad Hoc Problems Solution
  3. Data Structures & Libraries problem Solution
  4. UVa Mathematics Problem Solution
  5. String Processing Problem Solution
  6. Computational Geometry Problem Solution
  7. Graphs Problem Solution
  8. Other Problem Solution
knowledgediarybd.com © 2017
shares