9 October 2011 Comments Off

Call for contest: Daffodil Pre-ACM Computer Programming Contest 2011 (Bangladesh)

Call for contest: Daffodil Pre-ACM Computer Programming Contest 2011 (Bangladesh)

Daffodil International University is organizing Daffodil Pre-ACM Computer Programming Contest (Daffodil PACM2011) to give a platform for the young talents to come together for the next generation ICT developments.

Participants
A maximum of 50-60 teams from different universities all over the country will be participating in Daffodil PACM2011. Each team consists of three contestants. Each contestant must be a student enrolled in a degree program at the participating institution with at least a half-time load. After registration, in case of absolute necessity only one
substitution in a team can be made and the new member must be eligible for the contest, which must be confirmed prior
to two days before the contest.
A representative of the participating university, typically a faculty member, must serve as or designated as the team
coach. The team coach certifies the eligibility of contestants and serves as the official point-of-contact with the team,
prior to and during contest activities. Participating universities will be issued an invitation letter by postal mail.

Registration Procedure
• Registration should be completed online at ACM ICPC website at http://cm2prod.baylor.edu/login.jsf and
for onsite, either download the registration form at http://www.daffodilvarsity.edu.bd/pacm2011/ or use
the official copy sent at the university. Take a print out and after filling up the registration form send at
Department of CSE/CS/CIS, Daffodil International University, House 102, Shukrabad, Mirpur Road, Dhaka
1207 . In either case, online registration is mandatory. In case of problems, please contact as follows.
• The Registrar or the Dean of the Faculty or the Head of the department of the institution, along with the
official seal, has to authorize each registration form.
• Authorized registration form must be sent by postal mail or delivered directly towards the contact persons as
outlined in contact section or to the Department Office.
• Registration Fee: Tk. 2,000.00 (Two Thousand Taka) (Cash / Pay-order in favor of Daffodil
International University)
Important Dates
• Registration Opens: 12 October, 2011
• Last date of registration: 24 October, 2011
• Mock Contest: Saturday: 29 October, 2011
• Contest : Saturday 29 October, 2011

Number of Teams
a) Every university participating in International Collegiate Programming Contest (ICPC), Dhaka Regional Final
2011 will get at least one team.
b) No University will get more than 3 (three) teams.
c) For any university extra N team(s) will get the chance to participate, where N = number of teams in the rank list
in ICPC 2010.
d) For any university extra one team will get the chance to participate if at least one team (excluding the teams that
came in the rank list) solves a problem in ICPC 2010.
Daffodil Pre-ACM Computer Programming Contest 2011
House 102, Shukrabad, Mirpur Road, Dhaka 1207, Bangladesh
Tel: 8130864, 8129177, 9131947, 8129348 Ext 153 Fax: 9131947
www.daffodilvarsity.edu.bd
e) Any university who hasn’t participated in ICPC 2010 contests may get one team depending on the availability (at
most 60 teams will be allowed).
f) The program committee reserves all the rights to accept or reject any additional teams after fulfilling the abovementioned
criterion.
g) The contest hosting university may be allowed to additional teams, which will be decided by program
committee.
Daffodil PACM2011 Contest
All problems will be set in English and there will be approximately 8-10 problems for the contest duration of 5 hours.
The contestant is allowed to solve the problem in any of the allowed programming language. Contestant may bring
printed resource materials but not any machine-readable source. The contestants will not be allowed to use any form of
electronic means or any device to help in the computation.
For unavoidable circumstances, the Organizing Committee may change the contest duration.
Computing Environment
Only one computer will be allocated for each team in the contest. The operating system for the contest will be windows
XP. The programming languages allowed in the contest are C, C++, Java, Visual C++ and JCreator will be provided as
an editor for corresponding languages. PC^2 judging tool will be used to submit the solutions.

Contact Persons s
Dr Syed Akhter Hossain
Professor and Head
Department of Computer Science & Engineering
Tel: 8130864, 8129177, 9131947, 8129348 Ext 153
Fax: 9131947
Mob: 0187 382645
Email: aktarhossain@daffodilvarsity.edu.bd
Mr Kamanashis Biswas, Md Zahidul Karim, Md. Nazmul Haque and Md Samiullah
Department of Computer Science & Engineering
Tel: 8130864, 8129177, 9131947, 8129348 Ext 122
Email: ananda@daffodilvarsity.edu.bd; nazmul@daffodilvarsity.edu.bd
Md Nadir Bin Ali
Senior Asstt Director – IT
Tel: 8130864, 8129177, 9131947, 8129348 Ext 116
Mob: 01713493070
Email: it@daffodilvarsity.edu.bd
Daffodil Pre-ACM Computer Programming Contest 2011
House 102, Shukrabad, Mirpur Road, Dhaka 1207, Bangladesh
Tel: 8130864, 8129177, 9131947, 8129348 Ext 153 Fax: 9131947
www.daffodilvarsity.edu.bd
Daffodil Pre-ACM Computer Programming Contest 2011
(Daffodil PACM2011)
Program Schedule (Tentative)
Day-1: Friday, October 28, 2011
Time Event Venue
11:00 – 13:00 Registration and Kit Collection Daffodil Main Campus
15:00 – 17:00 Registration and Kit Collection Daffodil Main Campus
Day-2: Saturday, October 29, 2011
Time Event Venue
8:00am – 8:45am Reporting at Site Daffodil Campus
9:00am – 2:00pm Daffodil PACM 2011 Contest Daffodil Campus
2:30pm – 3:30pm Lunch Daffodil Campus
4:00pm – 5:00pm Prize Giving Ceremony Daffodil Campus

Venue
Daffodil International University
House 102, Shukrabad
Mirpur Road
Dhaka 1207
Tel: 8130864, 8129177, 9131947, 8129348 Ext 153
Fax: 9131947
Mob: 0187 382645
Contest URL: http://www.daffodilvarsity.edu.bd/pacm2011/
Daffodil Pre-ACM Computer Programming Contest 2011
House 102, Shukrabad, Mirpur Road, Dhaka 1207, Bangladesh
Tel: 8130864, 8129177, 9131947, 8129348 Ext 153 Fax: 9131947
www.daffodilvarsity.edu.bd

Contest Rules
Welcome! contestants from 30 different universities to battle for problem sloving. This
morning is welcoming you to solve 9 problems in 300 minutes.
• Each team has access to one computer work station with a set of independent
problems which may be solved in any order.
• Teams are not allowed to use any kind of electronics including USB, cell phone
etc along with the Internet.
• The contest runs for five hours and consists of nine problems. Scores are available
on-line to contestants and to spectators, except that they are not updated during
the last hour of the contest (so as to ensure suspense about the final rankings).
• Don’t write team name in your code. In this case, actual verdict will not be
provided and your submission will be penalized.
• For any questions about the problems, you can send your clarifications through
PC^2. You must not ask any irrelevant questions. Judges can take any decision
even can disqualify your team.
• In case of problem with network or system, please seek help of volunteers and
system supports and have patience.
• While giving printout of code, please write your team ID above the code and the
volunteer will give you the printed paper based on team ID.

http://www.daffodilvarsity.edu.bd/pacm2011/

26 September 2011 Comments Off

Unofficial Ranklist of SUST Contest (Bangladesh), 2011

This result is unofficial and unverified. Collected from cuetcoders@yahoogroups.com

Rank Name Solved Time Total att/solv
1 RETURN_OF_THE_CROWS 6 866 15/6
2 SUST_PROTTUTGOTO 5 556 12/5
3 DU_RESONANCE 5 570 8/5
4 SUST_PALINDROME 5 693 6/5
5 BUET_AETERNITAS 5 705/ td> 9/5
6 BUET_DYNAMITES 4 414 11/4
7 DU_ILLUMINATOR 4 457 5/4
8 BUET_JA_ISSA_TAI 4 544 12/4
9 SUST_ATTOPROTTOYEE 4 627 10/4
10 DU_HAU_MAU_KHAU 3 281 16/3
11 INFINITUM-NIHIL 3 384 10/3
12 ELIMINATOR 3 430 14/3
13 SEU_FALLEN_PRIME 3 454 5/3
14 DU_PROXIMA_CENTAURI 3 507 6/3
15 BUET_HAPPY-GO-LUCKY 3 534 8/3
16 NSU_ARDENT 3 590 6/3
17 UIU_SURGE 3 690 12/3
18 DU_ARMY_ANTS_RELOADE 2 100 5/2
19 BUET_ASYMPTOTES 2 140 15/2
20 NSU_WARSHEEP 2 237 2/2
21 IU_CSE_FREEDOM71 2 253 8/2
22 SUB_TRILOGY 2 260 5/2
23 DCC_SPARTA 2 303 9/2
24 SUST_CHAMELEONS 2 310 3/2
25 KERNEL 2 313 6/2
26 DUET_SPARKLE 2 318 8/2
27 DCC_MEGA_MIN D 2 357 7/2
28 JU_PRANTIK 1 7 9/1
29 EWU_CTRLPLUSZ 1 9 3/1
30 STUBBORNS 1 10 1/1
30 SUST_ANONYMOUS 1 10 1/1
30 SUST_INCREDIBLE 1 10 4/1
30 UAP_CRUSHOVERRIDE 1 10 2/1
34 NSU_STRIKERS 1 11 1/1
35 CU_CRUSNIC 1 12 3/1
3 5 JU_DAMAGE_PLAN 1 12 3/1
35 SOFT 1 12 3/1
35 SUST_SANNINS 1 12 4/1
39 SEC-BUILDER 1 13 3/1
40 SEU_BROKEN_DREAMS 1 15
40 SUST_DREAMERS 1 15 2/1
40 SUST_SWAPNOPOTHIK 1 15 4/1
43 SEU_911 1 16 1/1
44 EWU_BAD_BOYZ 1 17 4/1 /td>
44 IIUC_THREEVUJ 1 17 6/1
44 SUB_EPSILONS 1 17 2/1
47 NSU_CODE_JAMMERS 1 18 4/1
48 BGC_JUMPSTART 1 20 1/1
48 IITDU_PIONEERS 1 20 8/1
48 MIST_for_a_while 1 20 7/1
48 NOTHING_JU 1 20 2/1
48 SUST_DARK_HORSE 1 20 7/1
53 AUST_UNBREAKABLE 1 21 4/1
54 UIU_SALIENT 1 23 1/1
55 LU_TIGERS 1 24 1/1
55 SUB_PLODDER 1 24 7/1
57 SUST_BUTTERFLIES 1 25 2/1
58 SUST_UNTITLED 1 26/ td> 4/1
59 RUET_ABNORMALZ 1 27 11/1
60 BRACU_BYTE 1 32 7/1
60 UAP_ANGELS 1 32 4/1
62 SUST_AMEATURE 1 33 6/1
63 SUB-OPROTTASHITO 1 35 1/1
64 AIUB_HYPERDRIVES 1 37 2/1
65 SUST_RAY 1 38 1/1
66 MU_18_SPARKS 1 39 4/1
67 AUST_RADIANT S 1 42 3/1
68 NSU_THREE 1 44 1/1
69 EXPLOSIVE 1 53 2/1
70 MU_CHONNOCHARA 1 54 3/1
71 CU_WRAPPER 1 57 3/1
72 IU_NATUN_SHAKAL 1 64 3/1
73 DIU-HARBINGER 1 67 1/1
74 RUET_UNTRACEABLE 1 69 13/1
75 BRACU_EAGLES 1 74 5/1
76 SUST_UDDOMY 1 78 2/1
77 SILICON-CREWS 1 81 5/1
78 LU_LIONS 1 87 3/1
79 PSTU_DESERTCREATOR 1 97 3/1
80 DECIPHER 1 99 4/1
81 SEC-ALIENS 1 100 1/1
82 CU_ABACUS 1 104 15/1
83 JNU-DYNAMITE 1 105 1/1
84 SADAMATA 1 124 6/1/ td>
85 SUST_ECSTASY 1 135 7/1
86 SEC_TIN-YEARI 1 141 12/1
87 SEC_KNIGHTRIDERS 1 143 4/1
88 AUST_3IDIOTS 1 166 20/1
89 IU_CSE_3DIMENSION 1 175 7/1
90 BGC_OPROKASHITO 1 191 1/1
91 DROID_AUST 1 200 7/1
92 SYSTEM32 1 305 4/1
93 CRACKERZ 1 311 8/1
94 ICT_ANTI-VIRUS 0 0 0/0
94 ICT_HUNTERS 0 0 0/0
94 ICT_VIRUS 0 0 7/0
94 LU_NEOPHYTE 0 0 0/0
94 SEC-FIGHTER 0 03/–
94 SIU_TEAM 0 0 2/0
94 SUB-RECURRENCE 0 0 2/0
94 ULAB_PATICODERS 0 0 4/0
Submitted/1st Yes/Total Yes 536/152
Tags: , , ,
5 June 2011 1 Comment

The National Collegiate Programming Contest (NCPC) Dhaka University 2011

The National Collegiate Programming Contest (NCPC) Dhaka University 2011

National Collegiate Programming Contest, a computer programming contest, held at Dhaka University (DU) Computer Science and Engineering department yesterday to encourage students to be programmers. DU Vice Chancellor Prof AAMS Arefin Siddique inaugurated the two-day long contest participated by 78 teams of different university students. The department with the help of the science and ICT ministry organised the contest with Contest for only female programmers, for the first time, was held yesterday with 10 teams, out of 50 from 26 universities, being selected with respect to performance.

Female programmers at work during National Collegiate Programming Contest-2011, a computer programming competition, at Dhaka University Computer Science and Engineering Department yesterday.Photo: STAR

The result is in-complete & collected from here

Rank Name Solved Time
1 DU Resonance 6 492
2 BUET DubDub 6 658
3 BUET Dynamites 6 681
4 BUET Aeternitas 5 358
5 SUST_Palindrome 5 487
6 DU Primes 5 565
7 BUBT_Illuminati 5 570
8 SUST_Attoprottoyee 5 703
9 BUET Asymptotes 5 745
10 BUET Ja Issa Tai 5 755
11 DU Illuminator 5 787
12 SUST Prottutgoto 5 892
13 IUT Minnows 4 387
14 DU Impulse 4 459
15 EU_BLIZZARD 4 635
16 AIUB – Singularity 4 658
17 SEU_Fallen_Prime 4 756
18 BUBT Black Holes 4 768
19 MIST Kernel 3 330
20 DU Proxima Centauri 3 411
21 IITDU Zero 3 440
22 AIUB – Terminus Bound 3 552
23 UIU. Surge 3 688
24 NSTU Silicon Crews 2 179
25 DU Army Ants 2 214
26 JU Prantik 2 218
27 AUST_Unbreakable 2 274
28 CUET ICON 2 305
29 Stamford Burnout 2 313
30 CUET-ULTRAVIOLET 2 314
31 SUB_Eps 2 321
32 SEU_911 2 337
33 PSTU-DesertCreator 2 366
34 JU_shangshaptok 2 378
35 MIST For A While 2 399
36 CUET Oprokritistho 2 399
37 CU PRIMER 2 411
38 IU_CSE_FREEDOM71 2 445
39 RU Shadow 2 476
40 KUET_Worship 2 517
41 UAP crushOverride 1 38
42 DCC – Athena 1 101
43 BRACU Qubit 1 103
44 DU All Spark 1 124
45 Stamford I/O 1 132
46 MBSTU Inception 1 147
47 CU CORE 1 150
48 EWU Jonak 1 202
49 AUB_Unix 1 252
50 IITDU Pirates 1 258
51 NUB_GNOME 1 284
52 HSTU-Invader 1 294
53 DIU SERENDIPITY 1 315
54 DUET_Sparkle 1 377
55 ULAB PATH FINDER 1 408
56 DCC – Mega Mind 1 417
57 SUB-FRACTAL 1 455
58 KUET_Firebugs 1 492
59 AUST_IInvincible 0 0
59 Begum Rokeya Spurring 0 0
59 City_BraveHearts 0 0
59 DCC – Ajax 0 0
59 DIU-HARBINGERS 0 0
59 EU Hidden Treasure 0 0
59 EU_DOTS 0 0
59 HSTU DE_ART 0 0
59 ICE_IU_Kushtia 0 0
59 IIUC Stubbornz 0 0
59 IUB Trojan Horses 0 0
59 IUBAT FRINGE 0 0
59 Jagannath U Matrix 0 0
59 KU-Navigator 0 0
59 MBSTU ICT Aguntuk 0 0
59 MU_Rainbow 0 0
59 Prime Photon 0 0
59 SIU 0 0
59 ULAB CODE WARRIOR 0 0
59 USTC DURONTO 0 0
Submitted/1st Yes/Total Yes
Tags: , ,
1 June 2011 Comments Off

ACM-ICPC World Final 2011 Problems – by Petr Mitrichev

I couldn’t stop myself from sharing a nice post from Petr Mitrichev’s blog:

“(…) I’ve taken some time to reflect on the World Finals problems – hopefully that will be interesting for you to read. If you were not following the World Finals closely, you should probably skip this post :)

The problems are at http://cm.baylor.edu/digital/icpc2011.pdf, the unofficial solutions from Per at http://www.csc.kth.se/~austrin/icpc/finals2011solutions.pdf.

I’ve really liked the problemset, so please don’t take my words below as criticism – I’ve just tried to look at the problems from different angles and classify them in different ways, and maybe suggest some improvements for the future.

Problem A – To Add or to Multiply – ad-hoc (number theory?) (by ad-hoc I mean “need creative thinking to solve but no necessary prior algorithm/mathematics knowledge or experience solving similar problems”), most difficulty in corner cases and finding the lexicographically smallest answer.
Problem B – Affine Mess – exhaustive search (do what’s described in the problem statement) + solving a system of 2 linear equations, most difficulty in corner cases.
Problem C – Ancient Messages – ad-hoc, out-of-format problem, as there’s no precise definition of valid input.
Problem D – Chips Challenge – maximum flow (reduction to flow is the most difficult part).
Problem E – Coffee Central – exhaustive search (do what’s described in the problem statement) + the набившая оскомину idea about using inclusion-exclusion for rectangle sums. Most difficulty in finding the lexicographically smallest answer.
Problem F – Machine Works – DP plus incremental convex hull within one quadrant. The key to producing NlogN solution is the somewhat well-known idea about incremental convex hull to find the maximum of a set of linear functions. Most difficulty is inventing this speedup (if not known in advance) and implementing incremental convex hull.
Problem G – Magic Sticks – ad-hoc, geometry. The solution has two main parts – inventing and then proving (or believing) the key mathematical fact about throwing away the longest edge, and solving a sub-problem where you have to maximize the area of the polygon with the given sides. The sub-problem is again quite well-known and was a significant advantage to the teams who saw it before. However, I believe the most difficult part was the longest edge fact. There was also a catch about one edge taking more than Pi angle which many teams forgot to account for.
Problem H – Mining Your Own Business – graph theory, ad-hoc. The most mathematically beautiful problem of the contest in my opinion. The main difficulty is constructing the “if and only if” condition for the set of escape shafts.
Problem I – Mummy Madness – interval trees (or priority queues), ad-hoc. The main difficulty is realizing (a.k.a proving or believing) the problem can be reduced to checking if a square is completely covered by a set of squares. The NlogN solution to that sub-problem is very well-known and should be very easy for top teams.
Problem J – Pyramids – quite straightforward DP (backtracking should also work). I don’t see any significant difficulty at all here, but if I were to choose the main difficulty, it would be building the lexicographically largest answer in the DP solution.
Problem K – Trash Removal – a well-known problem. Solvable in NlogN using rotating calipers, but since the constraints were so low, that solution is an overkill. The only difficulty with such small constraints was to realize that the line should be parallel to the line connecting some pair of vertices. The main difficulty is the geometric formulas, but those are very easy as well.

Problem H was really standing out from the problemset, in my view, because it required graph theory thinking but at the same time involved no heavyweight algorithms or implementation difficulties. I would love to see more problems like this, but they are very hard to come up with. Problem C is unusual (so one might argue it gets close to the boundary of teams might reasonably expect) but still good. Problems E, F, I, J, K are “professional” problems – the most difficult part of each lies in a “standard set of tools” that most competitive programmers hone from contest to contest. This is not a negative thing – those ideas form the standard set of tools exactly because they’re most useful “building blocks” of various algorithms. Problem K may be too well-known though. Problem G is borderline as it combines a beautiful ad-hoc part with quite difficult algorithm that might be well-known to some teams but not others. Problem D is borderline (but still very good in my opinion) because the “reduce to maximum flow” trickery can also be viewed as a part of “standard set of tools”, and thus the problem is quite “professional” too. Problems A, E, J require relatively little thought, and have main difficulty in figuring out the corner cases and careful implementation, which is not exciting, and I’d say 3 such problems is too much (but maybe I’m too subjective after several teams I’ve supported got buried in those issues).

To spice up the long text, here’s my picture with the World Champions:

Please share your thoughts :) …”

31 May 2011 Comments Off

Ranklist (Scoreborad) ACM ICPC WF 2011

ACM International Collegiate Programming Contest (abbreviated as ACM-ICPC or just ICPC) is an annual multi-tiered computer programming competition among the universities of the world.Congratulations to Zhejiang University – the 2011 ACM-ICPC World Champions!

Congratulations to Zhejiang University – the 2011 ACM-ICPC World Champions!

Photo by Ravi Melaram

Photo by Jason Daly

Rank Team Solved Time
1 Zhejiang University 8 1228
2 University of Michigan at Ann Arbor 8 1462
3 Tsinghua University 7 800
4 St. Petersburg State University 7 893
5 Nizhny Novgorod State University 7 938
6 Saratov State University 7 966
7 Friedrich-Alexander-University Erlangen-Nuremberg 7 1088
8 Donetsk National University 7 1155
9 Jagiellonian University in Krakow 7 1176
10 Moscow State University 7 1187
11 Ural State University 7 1345
12 University of Waterloo 7 1555
13 Taurida V.I. Vernadsky National University 6 614
14 National Taiwan University 6 804
15 University of Warsaw 6 872
16 St. Petersburg State University of IT, Mechanics and Optics 6 931
17 Nanyang Technological University 6 958
18 Universidad de Buenos Aires – FCEN 6 965
19 Korea Advanced Institute of Science and Technology 6 965
20 Peking University 6 1012
21 Sharif University of Technology 6 1066
22 Carnegie Mellon University 6 1110
23 Shanghai Jiao Tong University 6 1113
24 Lviv National University 6 1150
25 The Chinese University of Hong Kong 6 1243
26 Zhongshan (Sun Yat-sen) University 6 1367
27 University of Electronic Science and Technology of China 5 648
28 Taras Shevchenko Kiev National University 5 754
29 Massachusetts Institute of Technology 5 803
30 Belarusian State University 5 811
31 Universidade Federal de Pernambuco 5 817
32 University of Tokyo 5 822
33 South Ural State University 5 839
34 Kazakh-British Technical University 5 874
35 Perm State University 5 927
36 Kyoto University 5 935
37 Novosibirsk State University 5 1010
38 Fudan University 5 1225
39 Harbin Institute of Technology 5 1312
40 Tianjin University 5 1353
41 University of Helsinki 5 1447
42 Universidade Federal do Paraná 4 386
43 Moscow Institute of Physics & Technology 4 452
44 Wuhan University 4 550
45 Universidade de São Paulo – Escola Politécnica 4 590
46 Princeton University 4 673
47 Universidade de São Paulo – Instituto de Matemática e Estatística 4 675
48 International Institute of Information Technology – Hyderabad 4 710
49 East China Normal University 4 732
50 Universidad Nacional de Córdoba – FaMAF 4 759
51 University of Alberta 4 763
52 Seoul National University 4 772
53 Swiss Federal Institute of Technology Zurich – VIS 4 808
54 Beijing Jiaotong University 4 813
55 Indian Institute of Technology – Delhi 4 862
56 University of Wroclaw 4 896
57 University of Stellenbosch 4 981
58 Pontificia Universidad Católica del Perú 4 1025
59 Hangzhou Dianzi University 3 263
60 Fuzhou University 3 272
61 California State University – Chico 3 288
62 German University in Cairo 3 389
63 University of New South Wales 3 395
64 Ain Shams University 3 426
65 Bangladesh University of Engineering and Technology 3 431
66 Leiden University 3 447
67 Huazhong University of Science & Technology 3 447
68 Instituto Tecnológico de Aeronautica 3 491
69 University of Miami 3 536
70 Shandong University 3 538
71 Universidade Federal de Minas Gerais 3 560
72 Harvey Mudd College 3 601
73 Simon Fraser University 3 682
74 Ho Chi Minh City University of Science 2 137
75 University of Oklahoma 2 142
76 Hong Kong University of Science and Technology 2 152
77 Universidad de Guanajuato – CIMAT 2 159
78 Zhejiang Normal University 2 193
79 University of Chicago 2 225
80 Duke University 2 243
81 Alexandria University – Faculty of Engineering 2 248
82 American University of Sharjah 2 299
83 Harbin Engineering University 2 332
84 University of Wisconsin – Madison 2 359
85 Orel State Technical University 2 374
86 Universidad del Valle 2 375
87 Universidad Católica Boliviana – La Paz 2 377
88 University of Minnesota – Twin Cities 2 408
89 Universidad de las Ciencias Informáticas 2 426
90 University of California – San Diego 2 542
91 University of Maryland 2 596
92 Illinois State University 2 607
93 Universidad de La Habana 2 703
94 Universidad Nacional de Colombia – Bogotá 2 718
95 University of Virginia 2 883
96 University of Canterbury 1 38
97 South Dakota School of Mines and Technology 1 146
98 EAFIT University 1 175
99 Cairo University – Faculty of Computers and Information 1 193
100 University of Illinois at Urbana-Champaign 1 242
101 Amirkabir University of Technology 0 0
101 DJ Sanghvi College of Engineering 0 0
101 Indian Institute of Technology – Kanpur 0 0
101 King Abdullah University of Science and Technology 0 0
101 Sichuan University 0 0

Well.done all teams specially-B.U.E.T. Annihilator, Dr. Mohammad Kaykobad, Tasnim Imran Sunny, Muntasir Mashuq, Anindya Das for solving three (3) problems.
Source: http://scrool.se/icpc/wf2011/

30 May 2011 Comments Off

The 2011 World Finals Ranklist – ACM International Collegiate Programming Contest

The 2011  World Finals Ranklist – ACM International Collegiate Programming Contest. See live cast:

http://scrool.se/icpc/wf2011/

http://www.icpclive.com/?page=live333#

photo by Bettina Johnson

John Bonomo, ICPC World Finals chief judge, has been part of the judging team since the 2002 Honolulu competition. “Our main purpose is to handle any slight problems with the test data, look at problems that contestant teams continually get wrong, and for clarification,” he said. Bonomo explained how the judging process has become increasingly automated with the advancement of technology. “We used to look through code and run testing,” he said. “Now the satisfaction comes from crafting challenging sets of problems.”

According to ICPC director of judges Jo Perry, there is one judge per problem in the World Finals. The chief judge and director of judges are used as extra hands during the finals and are also responsible for putting the problem sets together for the competition. Perry became involved with the judging side of the competition after being asked by a colleague at North Carolina State University to submit problems to a then infant ICPC competition.

Some of the judging staff became involved with judging simply for their love of the ICPC. Originally born in Sweden and now living in Canada, Per Austrin became involved with the competition as a contestant for his Swedish university. He joined the judging team when he could no longer compete due to age and has been a regular World Finals judge since 2008. “I enjoy the contest,” he said. “The construction of problems is almost like the other side of solving them.”

Former Google programmer Derek Kisman got his start with the World Finals as a contestant for The University of Waterloo during the Prague competition. He said, “I love the ICPC and being behind the scenes now as a judge.” Kisman enjoys coming up with problems that spawn interesting discussions and plans to continue judging for the ICPC as long as possible.

While many on the judging team have always known the international programming competition under the familiar ICPC name, Stan Wileman remembers the forerunner to the official contest we know today. While attending the University of Houston as a graduate student, Wileman and his early team of programmers learned of a contest at Texas A&M. “We overslept the day of the completion and arrived at the tail-end,” Wileman said. “We were late but still managed to win the damn thing and split the $100 grand prize!”

Today, Wileman has earned two hats with the ICPC as a World Finals judge and the regional director of North Central North American region. Bettina Johnson, ICPC Digital

Live Ranklist

http://scrool.se/icpc/wf2011/