tag:blogger.com,1999:blog-36974898880890303222025-05-03T03:46:03.004+03:00programming contest problems and solutionsAcm uva online judge problems and solution using C++ and JavaNawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.comBlogger37125tag:blogger.com,1999:blog-3697489888089030322.post-87261231950528326482012-05-23T13:55:00.001+02:002012-05-23T13:57:41.356+02:00ACM - UVA 108 - Maximum Sum<div dir="ltr" style="text-align: left;" trbidi="on">
Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=44">108 - Maximum Sum</a><br />
Solution: C++<br />
Hints: <a href="http://www.algorithmist.com/index.php/UVa_108">http://www.algorithmist.com/index.php/UVa_108</a><br />
<br />
<a href="http://www.blogger.com/blogger.g?blogID=3697489888089030322" name="more"></a>#include <iostream><br />
#include <cstdio><br />
#include <algorithm><br />
#include <cstring><br />
#include <string><br />
#include <cctype><br />
#include <stack><br />
#include <queue><br />
#include <list><br />
#include <vector><br />
#include <map><br />
#include <sstream><br />
#include <utility><br />
#include <set><br />
#include <math.h><br />
using namespace std;<br />
<br />
#define Dif(i,j,k) (Table[i+k][j] - Table[i][j])<br />
#define MAXN 110<br />
<br />
int N, MAX;<br />
int Table[MAXN][MAXN];<br />
<br />
void ReadCase()<br />
{<br />
int i, j;<br />
for(i = 1; i<=N; i++)<br />
for(j = 0; j<N; j++)<br />
scanf("%d",&Table[i][j]); <br />
}<br />
<br />
void Cal()<br />
{<br />
int i, j, k, t;<br />
for(i = 1; i<=N; i++)<br />
{<br />
for(j = 0; j<N; j++)<br />
Table[i][j] = Table[i][j] + Table[i-1][j];<br />
}<br />
<br />
MAX = Table[1][0];<br />
for(k = 1; k<=N; k++) <br />
{<br />
for(i = 0; i<=N-k; i++)<br />
{<br />
for(t = 0, j = 0; j<N; j++)<br />
{<br />
if(t>=0)<br />
t+= Dif(i,j,k);<br />
else <br />
t = Dif(i,j,k);<br />
if(t>MAX) <br />
MAX = t;<br />
}<br />
}<br />
} <br />
printf("%d\n",MAX); <br />
}<br />
<br />
void FREE() <br />
{<br />
int i, j;<br />
for(i = 0; i<=N; i++)<br />
for(j = 0; j<=N; j++)<br />
Table[i][j] = 0;<br />
}<br />
<br />
int main() <br />
{<br />
int f = 0; <br />
while(scanf("%d",&N) == 1) <br />
{<br />
if(f++)<br />
FREE();<br />
ReadCase();<br />
Cal(); <br />
}<br />
return 0;<br />
}<br />
</div>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-37379176854734228622012-05-23T13:55:00.000+02:002012-05-23T13:57:48.206+02:00ACM - UVA 116 - Unidirectional TSP<div dir="ltr" style="text-align: left;" trbidi="on">
<br>
Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=52">116 - Unidirectional TSP </a><br>
Solution: C++<br>
Hints: <a href="http://www.algorithmist.com/index.php/UVa_116">http://www.algorithmist.com/index.php/UVa_116</a><br>
<br>
</div><a href="http://acm-solution.blogspot.com/2012/05/acm-uva-116-unidirectional-tsp.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-86062711188447013372011-09-26T07:32:00.001+02:002011-09-26T07:33:32.559+02:00ACM - UVA 458 - The Decoder<div dir="ltr" style="text-align: left;" trbidi="on">Problem : <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=6&page=show_problem&problem=399">458 - The Decoder</a><br>
Solution : C++<br>
Hints : <a href="http://algorithmist.com/index.php/UVa_458">http://algorithmist.com/index.php/UVa_458</a><br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-458-decoder.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-6814382455186304152011-09-26T06:53:00.001+02:002011-09-26T06:55:49.275+02:00ACM - UVA 305 - Joseph<div dir="ltr" style="text-align: left;" trbidi="on">Problem : <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=5&page=show_problem&problem=241">305 - Joseph</a><br>
Solution : C++<br>
Hints : <a href="http://algorithmist.com/index.php/UVa_305">http://algorithmist.com/index.php/UVa_305</a><br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-305-joseph.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-50317952962558408472011-09-25T07:24:00.001+02:002011-09-25T07:24:49.824+02:00ACM - UVA 113 - Power of Cryptography<div dir="ltr" style="text-align: left;" trbidi="on">Problem : <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=3&problem=49&mosmsg=Submission+received+with+ID+9296900">113 - Power of Cryptography</a><br>
Solution : C++<br>
Hints : <a href="http://algorithmist.com/index.php/UVa_113">http://algorithmist.com/index.php/UVa_113</a><br>
<br>
<br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-113-power-of-cryptography.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com1tag:blogger.com,1999:blog-3697489888089030322.post-42617681444666420212011-09-25T07:11:00.001+02:002011-09-25T07:13:13.489+02:00ACM - UVA 111 - History Grading<div dir="ltr" style="text-align: left;" trbidi="on">Problem : <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=47">111 - History Grading</a><br>
Solution : C++<br>
Hints : <a href="http://algorithmist.com/index.php/UVa_111">http://algorithmist.com/index.php/UVa_111</a><br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-111-history-grading.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-43565639345077816802011-09-25T06:28:00.002+02:002011-09-25T06:31:35.986+02:00ACM - UVA 202 - Repeating Decimals<div dir="ltr" style="text-align: left;" trbidi="on">Problem : <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=138">202 - Repeating Decimals</a><br>
Solution : C++<br>
Hints : <a href="http://algorithmist.com/index.php/UVa_202">http://algorithmist.com/index.php/UVa_202</a><br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-202-repeating-decimals.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-83089824368969867482011-09-24T10:10:00.002+02:002011-09-24T10:17:30.267+02:00ACM - UVA 167 - The Sultan's Successors<div dir="ltr" style="text-align: left;" trbidi="on">Problem : <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=103">167 - The Sultan's Successors</a><br>
Soutioon : C++<br>
Hints : <a href="http://algorithmist.com/index.php/UVa_167">http://algorithmist.com/index.php/UVa_167</a><br>
<br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-167-sultans-successors.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-24748543684200858522011-09-23T09:41:00.002+02:002011-09-23T20:35:28.702+02:00ACM - UVA 200 - Rare Order<div dir="ltr" style="text-align: left;" trbidi="on">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=136">200 - Rare Order</a><br>
Solution: C++<br>
Hints : <a href="http://algorithmist.com/index.php/UVa_200">http://algorithmist.com/index.php/UVa_200</a><br>
<br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-200-rare-order.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-23876558253135459132011-09-23T04:21:00.001+02:002011-09-23T04:24:08.082+02:00ACM - UVA 154 - Recycling<div dir="ltr" style="text-align: left;" trbidi="on">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=90">154 - Recycling</a><br>
Solution: C++<br>
Hints: <a href="http://algorithmist.com/index.php/UVa_154">http://algorithmist.com/index.php/UVa_154</a><br>
<br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-154-recycling.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-36906963229098132242011-09-22T07:15:00.002+02:002011-09-22T07:23:03.693+02:00ACM - UVA 151 - Power Crisis<div dir="ltr" style="text-align: left;" trbidi="on">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=87">151 - Power Crisis</a><br>
Solution: C++<br>
Hints: <a href="http://algorithmist.com/index.php/UVa_151">http://algorithmist.com/index.php/UVa_151</a><br>
<br>
</div><a href="http://acm-solution.blogspot.com/2011/09/acm-uva-108-power-crisis.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-59926922760548090742010-11-16T03:37:00.001+02:002010-11-16T03:39:25.213+02:00ACM - UVA 106 - Fermat vs. Pythagoras<span class="Apple-style-span" style="line-height: 14px;"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=42">106 - Fermat vs. Pythagoras</a></span></span><br>
<span class="Apple-style-span" style="line-height: 14px;"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Solution: C++</span></span><br>
<span class="Apple-style-span" style="line-height: 14px;"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_106">http://www.algorithmist.com/index.php/UVa_106</a></span></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-106-fermat-vs-pythagoras.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-1674609730314856362010-11-15T06:45:00.000+02:002010-11-15T06:45:59.095+02:00ACM - UVA 160 - Factors and Factorials<span class="Apple-style-span" style="line-height: 14px;"><span class="co2"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=96">160 - Factors and Factorials</a></span></span></span><br>
<span class="Apple-style-span" style="line-height: 14px;"><span class="co2"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Solution: C++</span></span></span><br>
<span class="Apple-style-span" style="line-height: 14px;"><span class="co2"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_160">http://www.algorithmist.com/index.php/UVa_160</a></span></span></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-160-factors-and-factorials.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-44663588839767730072010-11-14T07:31:00.002+02:002010-11-14T07:55:56.857+02:00ACM - UVA 120 - Stacks of Flapjacks<span class="Apple-style-span" style="line-height: 14px;"><span class="co2"><span class="Apple-style-span" style="font-size: small;"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=56">120 - Stacks of Flapjacks</a></span></span></span></span><br>
<span class="Apple-style-span" style="line-height: 14px;"><span class="co2"><span class="Apple-style-span" style="font-size: small;"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Solution: C++</span></span></span></span><br>
<span class="Apple-style-span" style="line-height: 14px;"><span class="co2"><span class="Apple-style-span" style="font-size: small;"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_120">http://www.algorithmist.com/index.php/UVa_120</a></span></span></span></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-120-stacks-of-flapjacks.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-86099677033552532712010-11-13T05:01:00.004+02:002010-11-13T06:48:42.659+02:00ACM - UVA 119 - greedy gift givers<span class="Apple-style-span" style="line-height: 14px; white-space: nowrap;"><span class="co2"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=55">119 - greedy gift givers</a></span></span></span><br>
<span class="Apple-style-span" style="line-height: 14px; white-space: nowrap;"><span class="co2"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Solution: C++</span></span></span><br>
<span class="Apple-style-span" style="line-height: 14px; white-space: nowrap;"><span class="co2"><span class="Apple-style-span" style="font-family: Times, 'Times New Roman', serif;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_119">http://www.algorithmist.com/index.php/UVa_119</a></span></span></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-119-greedy-gift-givers.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-78234544848192884142010-11-12T06:15:00.003+02:002010-11-12T06:30:15.542+02:00ACM - UVA 118 - Mutant Flatworld ExplorersProblem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=54">118 - Mutant Flatworld Explorers</a><br>
Solution: C++<br>
Hints:<a href="http://www.algorithmist.com/index.php/UVa_118">http://www.algorithmist.com/index.php/UVa_118</a><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-118-mutant-flatworld-explorers.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-2867050555529080072010-11-06T13:24:00.003+02:002010-11-06T13:33:10.427+02:00ACM - UVA 107 - The Cat in the HatProblem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=43">107 - The Cat in the Hat</a><br>
Solution: C++<br>
Hints:<a href="http://www.algorithmist.com/index.php/UVa_107">http://www.algorithmist.com/index.php/UVa_107</a><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-107-cat-in-hat.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-27570809391042745492010-11-05T06:33:00.002+02:002010-11-05T19:53:58.287+02:00ACM - UVA 138 - street numbers (Java)Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=74">138 - street numbers</a><br>
Solution: Java<br>
Hints: <a href="http://www.algorithmist.com/index.php/UVa_138">http://www.algorithmist.com/index.php/UVa_138</a><br>
<br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-138-street-numbers-java.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-36281190873448326912010-11-05T06:23:00.003+02:002010-11-05T06:28:00.388+02:00ACM - UVA 136 - Ugly Numbers (Java)<span style="color: black;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=72">136 - ugly numbers</a></span><br>
Solution: Java<br>
Hints: <a href="http://www.algorithmist.com/index.php/UVa_136">http://www.algorithmist.com/index.php/UVa_136</a><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-136-ugly-numbers-java.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-16622861875018211232010-11-04T17:38:00.005+02:002010-11-04T17:52:49.048+02:00ACM - UVA 278 - Chess<span style="font-size: x-small;"><span style="color: black; font-size: x-small;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=214">278 - Chess</a></span></span><br>
<span style="font-size: x-small;">Solution:C++</span><br>
<span style="font-size: x-small;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_278">http://www.algorithmist.com/index.php/UVa_278</a></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-278-chess.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-46626475681203727782010-11-03T05:28:00.005+02:002010-11-03T05:45:22.568+02:00ACM - UVA 11777 - Automate the Grades<span style="font-size: x-small;"><span style="color: black; font-size: x-small;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2877">11777 - Automate the Grades</a></span></span><br>
<span style="font-size: x-small;">Solution: C++</span><br>
<span style="font-size: x-small;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_11777">http://www.algorithmist.com/index.php/UVa_11777</a></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-11777-automate-grades.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-86886888991713612392010-11-02T04:23:00.005+02:002010-11-02T16:30:19.456+02:00ACM - UVA 103 - Stacking Boxes<span style="font-size: x-small;"><span style="color: black; font-size: x-small;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=39">103 - Stacking Boxes</a></span></span><br>
<span style="font-size: x-small;">Solution: C++</span><br>
<span style="font-size: x-small;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_103">http://www.algorithmist.com/index.php/UVa_103</a></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-103-stacking-boxes.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-77734994463476525782010-11-01T14:08:00.004+02:002010-11-06T13:14:40.460+02:00ACM - UVA 105 - the skyline problem<span style="font-size: x-small;"><span style="color: black; font-size: x-small;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=41">105 - the skyline problem</a></span></span><br>
<span style="font-size: x-small;">Solution: C++</span><br>
<span style="font-size: x-small;">Hints: <a href="http://www.algorithmist.com/index.php/UVa_105">http://www.algorithmist.com/index.php/UVa_105</a></span><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-105-skyline-problem.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-57151657212492440022010-11-01T13:49:00.003+02:002010-11-01T20:35:46.624+02:00ACM - UVA 100 - The 3n + 1 problem ( java )The problem:<a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=36">100 - The 3n + 1 problem</a><br>
The solution: Java<br>
Hints: <a href="http://www.algorithmist.com/index.php/UVa_100">http://www.algorithmist.com/index.php/UVa_100</a><br>
<a href="http://acm-solution.blogspot.com/2010/11/acm-uva-100-3n-1-problem-java.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0tag:blogger.com,1999:blog-3697489888089030322.post-79212366659541350082010-10-30T06:16:00.004+02:002010-10-30T06:37:59.947+02:00ACM - UVA 10071 - Back to High School Physics<span style="color: blue; font-size: x-small;"><span style="color: blue; font-size: x-small;"><span style="color: black;">Problem: <a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=1012">10071 - Back to High School Physics</a></span><br>
<span style="color: black;">Solution: C++</span><br>
<span style="color: black;">Hints:</span> <a href="http://www.algorithmist.com/index.php/UVa_10071">http://www.algorithmist.com/index.php/UVa_10071</a></span></span><br>
<a href="http://acm-solution.blogspot.com/2010/10/problem-solution-c-hints-httpwww.html#more">Read more »</a>Nawarhttp://www.blogger.com/profile/02915122080320414083noreply@blogger.com0