Groups
Groups
Sign in
Groups
Groups
Online Judge Helps
Conversations
About
Send feedback
Help
Online Judge Helps
1–6 of 6
Mark all as read
Report group
0 selected
Atiqur Rahman
,
MAK kader
2
2/6/09
STL map.
thats good , how to use pair? That's my next question. MAK Fond Of All New Home: www.mak11.co.cc
unread,
STL map.
thats good , how to use pair? That's my next question. MAK Fond Of All New Home: www.mak11.co.cc
2/6/09
Atiqur Rahman
2/6/09
UVA 544(Heavy Cargo).
This is a typical graph problem. Can be solvable using MST. DFS might give TLE. In the main loop of
unread,
UVA 544(Heavy Cargo).
This is a typical graph problem. Can be solvable using MST. DFS might give TLE. In the main loop of
2/6/09
Atiqur Rahman
2
1/6/09
Union Find Algorithm(dis-joint set data structure) and related UVA problems.
Also tell me if you find problems on this algorithm. Thanks.
unread,
Union Find Algorithm(dis-joint set data structure) and related UVA problems.
Also tell me if you find problems on this algorithm. Thanks.
1/6/09
Atiqur Rahman
12/26/08
Programming environments.
For problem solving you need to code the algorithm in your favorite programming language and then
unread,
Programming environments.
For problem solving you need to code the algorithm in your favorite programming language and then
12/26/08
Atiqur Rahman
12/25/08
UVA 10042 (Smith Number)
It's AC. It's one of the easy problems related to Number theory (Prime) A theory has helped
unread,
UVA 10042 (Smith Number)
It's AC. It's one of the easy problems related to Number theory (Prime) A theory has helped
12/25/08
Atiqur Rahman
12/25/08
UVA 130 (Roman Rouletter)
I got AC on this problem! I tried it in josephus but could not match it exactly. Josephus recurrence
unread,
UVA 130 (Roman Rouletter)
I got AC on this problem! I tried it in josephus but could not match it exactly. Josephus recurrence
12/25/08