125 Ad spot 125 Ad spot

ACMSolver or Art of Programming? 24 X 7 Updates

From 2002 ACMSolver is campaigning for free programming knowledge!

19 June 2011 Comments Off

Let’s Learn Programming (Sticky Post-updated daily)

Let’s Learn Programming (Sticky Post-updated daily)

Let’s create an alternative approach in computer programming learning.. here I plan to create a comic series using the characters from Futurama, my favorite TV series. Let me know what you think of this approach- Arefin

previous episodes..? click below

[...]

Tags:
7 January 2012 Comments Off

Programming Contest Training @ BUET 2012

A Programming Contest Training is going to be a 5 day event held at BUET from January 15, 2012 to January 19, 2012. Participants will be divided in two divisions – Advanced and Basic. Advanced division has a capacity of 35 and Basic division will accommodate 65 people.

https://sites.google.com/site/progcamp12/home

On the first day of the camp, you’ll need to pay (if selected) Tk. 500 as entry fee (School / College students are exempt from payment).

Picture- Illustrative, collected from Internet.

Bengali Version

2 December 2011 Comments Off

[Unofficial] BUET IUPC 2011 Ranklist

[Unofficial] BUET IUPC 2011 Ranklist

Please Be aware that this ranklist is unofficial and collected from buet_contest_teams@yahoogroups.com (Thanks to- Martuza)

Rank Name Points Time Total att/solv
1 BUET_Chokers 90 1153 27/13
2 DU_Unreadable 64 910 14/11
3 BUET_Dynamites 51 1248 22/10
4 BUET_Avengers_Reloaded 44 924 19/9
5 NSU_Ardent 42 828 18/9
6 BUBT_Illuminati 38 763 18/8
7 DU_Proxima_Centauri 38 795 20/8
8 BUET_Ja_Issa_Tai 38 1123 23/8
9 DU_Flies_On_The_Wall 34 579 13/7
10 BUET_Asymptots 33 654 27/6
11 AIUB_BIPROTEEP 24 263 18/6
12 AIUB_Infinitum_Nihil 24 348 20/6
13 BUET_Intruders 24 382 20/6
14 SUST_POTHIKRIT 24 411 26/6
15 DU_Illuminator 24 417 22/6
16 SEU_Fallen_Prime 24 447 28/6
17 IUT_Minnows 24 489 16/6
17 AIUB_HYPERDRIVES 24 489 14/6
18 CUET_ULTRAVIOLET 24 495 15/6
19 BUET_Faust 24 535 14/6
20 MIST_Kernel 24 542 9/6
20 CUET_Spark 24 542 12/6
21 DCC_Achiles 24 602 14/6
22 DCC_Sparta 24 656 12/6
23 MBSTU_ICT.Bok_Dharmik 24 696 11/6
24 SEU_Nazguls 24 711 14/6
25 UIU_Surge 24 745 24/6
26 Aust_Unbreakable 24 757 20/6
27 BUET_Packman 24 831 30/6
27 SUST_RAPTORS 24 831 18/6
28 IU_Freedom71 24 857 18/6
29 NSU_Warsheep 24 859 19/6
30 IIUC_Stubborns 24 932 14/6
31 EWU_triple_S 24 1050 16/6
32 BRACU_EAGLES 20 600 11/5
33 SUB_Recurrence 20 842 9/5
34 MIST_FOR_A_WHILE 19 419 13/5
35 SUB_TRILOGY 19 499 21/5
36 Stamford_Optimus_Prime 19 543 14/5
37 CUET_back_doors 19 809 15/5
38 NSU_Code_Jammers 19 811 11/5
39 BUET_Ten_Hundred 19 1229 22/5
40 EWU_Shunno 16 756 12/4
41 IIUC_Threevuj 15 224 11/4
42 MIST_Explosive 15 278 7/4
43 NSU_Strikers 15 334 20/4
44 AUST_VOID 15 410 14/4
45 DUET_Sparkle 15 561 21/4
46 IU_Natun_Shakal 15 568 4/4
47 AUB_Unix 15 767 9/4
48 Perro_ulab 15 768 11/4
49 MBSTU_Ecilis 15 791 14/4
50 Stamford_NewCommers 15 849 13/4
51 UAP_crushOverride 14 640 31/4
52 IUT_Apprenti 12 397 10/3
53 SEU_Unlucky 11 235 5/3
54 AUST_Rubberfly 11 269 7/3
55 SUB_CRYSIS 11 738 13/3
56 DCC_Return_0 9 276 8/2
57 Anonymous 9 373 7/2
58 ULAB_PATICODERS 8 374 2/2
59 IBAISU_Return_Zero 4 118 11/1
60 IIUCDC_Authentic 3 153 4/1
61 UAP_Blind_Archers 3 238 6/1
62 DIU_ENIGMA 0 0 0/0
62 DIU_HARBINGER 0 0 0/0
62 DUET_Codders 0 0 0/0
62 ICT_AUNTORJATRA 0 0 0/0
62 ICT_PURBOLEKHON 0 0 0/0
62 JnU_Neutrino 0 0 7/0
62 KUET-DREAMS 0 0 0/0
62 MBSTU_Accepted_Hunter 0 0 0/0
Submitted/1st Yes/Total Yes 988/342
20 November 2011 Comments Off

ACM-ICPC Dhaka Site Regional 2011 Ranklist

Final Rank List (Please be aware that this publication is unofficial and collected from cuetcoders@yahoogroups.com) :

Rank Name Solved Time Total att/solv
1 BUET .oO 5 505 20/5
2 SUST_PALINDROME 5 523 6/5
3 BUET_Ja Issa Tai 5 536 8/5
4 BUET_Aeternitas 5 541 8/5
5 DU_Resonance 5 568 13/5
6 DU_ Hau Mau Khau 5 590 12/5
7 BUET_Asymptotes 4 308 5/4
8 DU_Proxima Centauri 4 358 4/4
9 BUBT_Illuminati 4 365 5/4
10 BUET_Dynamites 4 466 9/4
11 SUST_AVALANCHE 3 183 8/3
12 NSU Ardent 3 235 9/3
13 SUST_POTHIKRIT 3 241 4/3
14 EU_Pretatta 3 325 8/3
15 DU_Illuminator 3 335 6/3
16 SEU_Fallen_Primes 3 463 13/3
17 AIUB INFINITUM NIHIL 2 38 11/2
18 CUET OPPROKRITISTHO 2 41 5/2
19 NSU Warsheep 2 42 11/2
20 DU_Army Ants Reloaded 2 43 10/2
20 UIU SURGE 2 43 4/2
22 EWU Ctrl+z 2 48 2/2
23 AIUB HYPERDRIVES 2 51 3/2
24 UIU Salient 2 51 2/2
25 IUT Minnows 2 53 11/2
26 RUET_%I64d 2 54 2/2
27 AIUB ELIMINATOR 2 54 7/2
28 DUET Sparkle 2 58 3/2
29 SUST_RAPTORS 2 58 2/2
30 UAP crushOverride 2 70 3/2
31 JU_DAMAGE PLAN 2 76 2/2
32 Stamford Optimus Prime 2 79 3/2
33 BGC_JumpStart 2 79 2/2
33 MBSTU.ICT.BokDharmik 2 79 5/2
35 BRACU EAGLES2011 2 81 3/2
36 RUET_ABNORMALZ 2 83 2/2
37 CUET ICON 2 86 3/2
38 BUET_Intruders 2 87 14/2
39 NSU Code_Jammers 2 89 2/2
40 IIUC-Threevuj 2 92 3/2
41 CU CRUSNIC 2 103 2/2
42 IITDU Zero 2 105 4/2
43 Return of the Soft 2 110 7/2
44 NSU_Strikers 2 112 4/2
45 KUET _Boger Thyang 2 116 5/2
46 LU Tigers 2 118 3/2
47 DCC Achilles 2 118 4/2
48 BRACU RANGERS 2011 2 122 2/2
49 EU_G.SQUARE 2 131 5/2
50 BRACU BYTE 2 134 4/2
51 JU_OPROTTASHITO 2 142 6/2
52 SUB Recurrence 2 147 8/2
53 KUET_Code Teasers 2 152 5/2
54 DCC Sparta 2 161 5/2
55 BRACU UnderDogs 2 163 6/2
56 Aust_Invincible 2 166 8/2
57 KUET_Saturation 2 167 3/2
58 KUET_DREAMS 2 173 3/2
59 PSTU_DESERTCREATOR 2 173 8/2
60 AUB Unix 2 200 4/2
61 BUBT Black Holes 2 200 7/2
62 KUET_Osthir !! 2 201 5/2
63 USTC_OPTIMISTIC 2 201 3/2
64 Nothing_JU 2 202 9/2
65 simpleX 2 219 4/2
66 CU GOOGLEPLEX 2 236 3/2
67 CU NOT DECIDED YET 2 240 3/2
68 NSU_Seismic 2 253 4/2
69 DUET_RUMPUS 2 253 10/2
70 Enigma 2 261 7/2
71 HSTU_INVADER 2 282 6/2
72 IUT_Apprenti 2 282 5/2
73 SUB TRILOGY 2 298 8/2
74 AUST RADIANTS 2 314 7/2
75 Team A 2 362 5/2
76 CUET_ULTRAVIOLET 2 370 12/2
77 IU_Freedom71 2 385 8/2
78 ADUST Pirates 2011 2 638 19/2
79 SEU_ nazguls 1 5 10/1
80 MU 18 sparks 1 8 2/1
81 RU Biks Cube 1 9 12/1
81 USTC_HOPE 1 9 10/1
83 EU Dots 1 11 3/1
84 NSTU Silicon Crews 1 12 7/1
84 ULAB_Perro 1 12 1/1
86 DIU ENIGMA 1 13 7/1
86 UAP Blind Archers 1 13 12/1
88 KUET_Dream Spark 1 14 5/1
89 KUET_Slipstream 1 15 2/1
90 DIU HARBINGER 1 16 1/1
91 Obinyosto Kochupata 1 18 1/1
92 JKKNIU_OneZero 1 24 1/1
93 CUET_VOID 1 25 1/1
94 DUET_FORESIGHT 1 26 1/1
95 DUET_BRAIN_FIGHTERS 1 29 14/1
95 IIUCDC-Authentic 1 29 6/1
97 DUET_Coders 1 31 5/1
98 RUET_BOOLZ 1 38 2/1
99 Return Zero 1 39 2/1
100 HSTU_SUPERNOVA 1 49 17/1
101 IU_Natun Shakal 1 60 5/1
102 Inception 1 66 12/1
103 pustcse 1 66 2/1
104 AUB Freak 1 69 4/1
105 SBPGC_Icarus 1 82 12/1
106 SUB_NEBULA 1 101 7/1
107 USTC EVERGREEN 1 107 3/1
108 BGC_Oprokashito 1 114 4/1
109 MU_Chhannochhara 1 116 3/1
110 NUB Luminous 1 118 4/1
111 BGC_Eliminator 1 142 5/1
112 JKKNIU_Freshers 1 195 14/1
113 Team B 1 361 5/1
114 SIU_Cyborgs 0 0 9/0
114 team117 0 0 0/0
114 team118 0 0 0/0
114 team119 0 0 0/0
114 team120 0 0 0/0
114 UODA Epsilon 0 0 9/0
Submitted/1st Yes/Total Yes 694/223

Created by CSUS PC^2 8.7 20081028 00
http://www.ecs.csus.edu/pc2/
Last updated Sat Nov 19 16:38:35 BDST 2011

12 November 2011 Comments Off

Guidelines by S. M. Shahriar Nirjon (collected from buet_contest_teams@yahoogroups.com)

Hello Readers, This is mail from Mr. S. M. Shahriar Nirjon (to buet_contest_teams@yahoogroups.com), I found it to be useful for the new programmers. Let’s check :)
———————
Hi Folks, (here in US, teachers sometimes call students Folks!!, I just imitated them to see how it feels, never mind.)
Nice to see sooo many eager persons who wants to learn algorithms and good programming. Seems like you guys want some ’shortcuts’ also- no
book reading, no papers- just attend some camps and there you fly. Trust me, it’s never going to be so easy. You HAVE to study books/papers/ articles/ other people’s codes/forums to learn these hings. However, camping is of course always a good idea.
In my opinion, although some/all may disagree, there had been no good book on algorithms for starters. Beginners look for the basic idea

and some examples, but the writers tend to fill the book with lemmas nd proofs. Some books try to do this, but the frustation among our
young programmers proves that these are not helping.

I would like to list steps in algorithms that new ‘folks’ may find nteresting. I am trying to remember what I learnt serially-

1) First, the simple problems that needs no particular algo. Like, all simulation type problems, all math problems, prime number realted
problems, big integer related problems etc. Also, learn sorting, inary search.

2) To make/use stack/queue and learn BFS. I solved ‘Knight moves’ as the first one. Then keep on solving all the BFS problems.

3) To learn DFS. My first problem was ‘Oil Deposits’. Now try to nderstand the difference between DFS/BFS.

4) To learn Topological sorting. If you know DFS, then you basically know this too.

5) Learn Backtracking. This is not any algorithm, rather a name for ecursive searching. Example problems are- N-queens, hamiltonian
cycle etc.It will give you the idea that, all the ACM problems are olvable by you, if you didnot have any time-limit.

6) At this point, you will feel that BFS/DFS/Backtracking is not good enough to find the shortest paths in graphs. So, you will learn 3 new
algorithms- Dijkstra, BellmanFord, Floyd-Warshall. Play with these Algorithms to understand, when to apply what.

7) At this point, you are little experienced with graphs. You should be learning Minimum Spanning Tree. Learn ‘Kruskal’ first, then
learn ‘Prim’.

8) There is particularly no age for starting Dynamic programming. But, once you are familiar with recursive relations, you should start
this fantastic thing. Learn quickly- LCS, 0/1 Knapsack, Matrix chain multiplication. Then solve varieties of DP problems.

Well, no more today. I mentioned at least a dozen of things to learn today. So, learn these if you haven’t yet. Figure out the next steps
(from 9 to infinity) by yourself. You will learn- max-flow, matching, inear-programming etc in these steps for sure.

That’s all Folks!

Bests-

S. M. Shahriar Nirjon
http://nirjon. googlepages. com
http://www.somewher einblog.net/ blog/nirjon_ buet

6 November 2011 Comments Off

Programming Contest Orientation at The University of Newcastle

Programming Contest Orientation at The University of Newcastle

A Programming Contest Orientation Class held at The University of Newcastle (CS/SE Discipline, School of EECS). Slides are from a programming contest workshop (2000) by Shahriar Manzoor and Rezaul Alam Chowdhury.

Presented by – Ahmed Shamsul Arefin (PhD Candidate, CS, Newcaslte U, AUS).
Coordinated by – Dr. Yuqing Lin, Lecturer in Computer Science, The University of Newcastle.

ACM ICPC Programming Contest Orientation
Download presentation: Here

6 November 2011 Comments Off

Video Tutorial – ACM -ICPC at UWA, Australia

Problem solving tactics for the ACM ICPC programming competition: search and optimisation from Evgeni Sergeev on Vimeo.