Skip to content

Commit b47d2ce

Browse files
keshavnandankeshavnandan
committed
srm 194 div 1 1000
1 parent 181fe5d commit b47d2ce

File tree

2 files changed

+253
-0
lines changed

2 files changed

+253
-0
lines changed

‎IslandFerries.cpp

Lines changed: 189 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,189 @@
1+
#include <iostream>
2+
#include <sstream>
3+
#include <vector>
4+
#include <algorithm>
5+
#include <set>
6+
#include <map>
7+
#include <queue>
8+
#include <cstring>
9+
#include <climits>
10+
#include <cstdio>
11+
using namespace std;
12+
typedef pair<int,int> pi;
13+
typedef vector<int> vi;
14+
typedef vector<vi> vvi;
15+
typedef vector<string> vs;
16+
typedef vector<vs> vvs;
17+
struct state
18+
{
19+
int pos;
20+
int cost;
21+
vi tickets;
22+
state(int p = 0, int c = 0, vi t = vector<int>(10, 0)){
23+
pos = p;
24+
cost = c;
25+
tickets = t;
26+
}
27+
};
28+
bool operator<(state a, state b){
29+
return a.cost > b.cost;
30+
}
31+
int num = 0;
32+
class IslandFerries{
33+
int dfs(int s, vvi &M, vi &vis){
34+
num++;
35+
vis[s] = true;
36+
for(int j = 0; j < 50; j++)
37+
if(!vis[j] && M[s][j] > 0) dfs(j, M, vis);
38+
}
39+
public:
40+
vector <int> costs(vector <string> legs, vector <string> prices) {
41+
num = 0;
42+
vvi M(50, vi(50, 0)), P = M;
43+
int m = legs.size(), n = prices.size();
44+
for(int i = 0; i < legs.size(); i++){
45+
stringstream ss(legs[i]);
46+
string s;
47+
while(ss>>s){
48+
int a, b;
49+
sscanf(s.c_str(), "%d-%d", &a, &b);
50+
M[a][b] |= (1<<i);
51+
}
52+
}
53+
for(int i = 0; i < n; i++){
54+
int j = 0, t = 0;
55+
stringstream ss(prices[i]);
56+
while(ss>>t) P[i][j++] = t;
57+
}
58+
59+
vi vis(50, 0);
60+
dfs(0, M, vis);
61+
cout<<"num = "<<num<<endl;
62+
priority_queue<state> Q;
63+
state s;
64+
Q.push(s);
65+
vi done(50, -1);
66+
int count = 0;
67+
set<pair<int, vi> > visited;
68+
69+
while(!Q.empty()){
70+
state p = Q.top();
71+
Q.pop();
72+
int pos = p.pos, cost = p.cost;
73+
vi tickets = p.tickets;
74+
75+
if(visited.find(make_pair(pos, tickets)) != visited.end()) continue;
76+
visited.insert(make_pair(pos, tickets));
77+
78+
if(done[pos] == -1){
79+
done[pos] = cost;
80+
count++;
81+
if(count == num) break;
82+
}
83+
int nt = 0;
84+
for(int t : tickets) if(t > 0) nt++;
85+
//buy more tickets if it is possible
86+
if(nt < 3){
87+
for(int i = 0; i < m; i++)
88+
if(tickets[i] == 0){
89+
tickets[i] = P[pos][i];
90+
Q.push(state(pos, cost+P[pos][i], tickets));
91+
tickets[i] = 0;
92+
}
93+
}
94+
95+
//Go to some other island utilising any one of the tickets in kitty
96+
for(int i = 0; i < m; i++)
97+
if(tickets[i] > 0){
98+
//visit all islands to check if ferry i can help to go from pos to j
99+
for(int j = 0; j < n; j++)
100+
if(M[pos][j] & (1<<i)){
101+
int t = tickets[i];
102+
tickets[i] = 0;
103+
Q.push(state(j, cost, tickets));
104+
tickets[i] = t;
105+
}
106+
}
107+
}
108+
return vi(done.begin()+1, done.begin()+n);
109+
}
110+
111+
// BEGIN CUT HERE
112+
public:
113+
void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
114+
private:
115+
template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
116+
void verify_case(int Case, const vector <int> &Expected, const vector <int> &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: " << print_array(Expected) << endl; cerr << "\tReceived: " << print_array(Received) << endl; } }
117+
void test_case_0() { string Arr0[] = { "0-1 0-3", "0-2" }; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = { "5 7", "1000 1000", "1000 1000", "1000 1000" };
118+
vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
119+
int Arr2[] = { 5, 7, 5 }; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(0, Arg2, costs(Arg0, Arg1)); }
120+
void test_case_1() { string Arr0[] = { "0-1 1-2 2-3", "0-1 2-3" }; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = { "1 10", "20 25", "50 50", "1000 1000", "1000 1000" }; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arr2[] = { 1, 11, 31, -1 }; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(1, Arg2, costs(Arg0, Arg1)); }
121+
void test_case_2() { string Arr0[] = { "0-1", "1-0", "0-2", "2-3" };
122+
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = { "1 1 1000 1000", "1000 1000 10 100", "1000 1000 1000 1000", "1000 1000 1000 1000" }; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arr2[] = { 1, 12, 112 }; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(2, Arg2, costs(Arg0, Arg1)); }
123+
void test_case_3() { string Arr0[] = {"22-19 29-33 25-32 21-30 24-30 35-31 4-8 9-7 18-3",
124+
"3-16 18-14 32-2 27-29 2-16 3-15 7-14 17-19 9-32",
125+
"24-32 11-13 19-9 13-26 28-31 13-3 24-10 19-36",
126+
"16-27 5-27 11-14 23-5 1-28 25-21 30-4 33-30 6-18",
127+
"26-36 34-29 28-8 9-19 29-36 36-17 30-4 36-34 9-1",
128+
"20-15 32-10 26-1 2-27 14-19 18-32 0-36 19-12 21-17",
129+
"34-28 17-20 16-17 33-36 1-29 2-33 27-15 4-27 5-11",
130+
"26-17 0-21 11-5 2-13 0-2 32-27 28-8 33-25 35-11",
131+
"11-12 28-8 3-21 2-0 11-2 29-14 4-11 9-24 14-7",
132+
"5-12 16-29 1-27 35-8 10-33 36-1 30-0 36-6 18-30"}
133+
; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] =
134+
{"586 591 10 693 87 8 5 26 30 576", "931 923 84 516 461 99 501 7 929 1", "649 57 104 6 880 715 671 845 554 6", "20 2 495 489 71 610 764 36 580 17",
135+
"517 504 8 270 43 205 36 52 339 228", "5 97 7 93 998 30 8 78 41 37", "18 88 25 34 4 573 277 7 968 2", "52 7 544 551 3 33 8 5 176 53",
136+
"3 50 7 796 10 319 947 746 3 79", "290 487 96 675 52 739 31 5 723 89", "8 6 9 91 9 419 11 762 90 34", "612 9 10 98 77 870 271 472 95 811",
137+
"30 96 656 641 906 3 6 430 4 930", "48 353 7 34 7 491 1 7 52 426", "128 10 12 262 314 446 946 842 7 86", "198 445 10 481 4 993 276 814 3 4",
138+
"11 161 56 964 466 179 938 52 3 28", "1 935 398 492 10 59 150 43 6 720", "63 3 5 49 8 2 3 19 69 6", "4 6 38 747 109 43 18 9 15 2",
139+
"859 592 91 704 775 12 841 34 3 3", "997 8 1 769 682 639 9 2 799 1", "60 620 8 5 10 72 250 37 798 8", "615 816 25 4 1 146 352 1 44 4",
140+
"2 10 280 8 17 3 553 404 37 76", "4 73 55 362 5 9 120 7 99 727", "819 999 10 48 4 519 467 522 12 8", "3 513 85 531 10 99 8 3 896 825",
141+
"804 112 848 507 4 100 5 947 5 11", "120 68 304 9 83 685 374 860 8 6", "7 9 5 275 3 5 34 917 87 2", "66 942 8 1 7 797 40 828 748 855",
142+
"6 3 952 194 7 253 257 1 85 56", "887 986 702 936 8 8 9 7 6 91", "10 99 2 877 393 9 586 3 896 3", "59 70 383 336 355 912 4 65 430 6", "220 245 766 10 62 176 6 96 59 4"};
143+
vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arr2[] = { 12, 26, 33, 27, 46, 12, 32, 26, 32, 43, 45, 70, 28, 25, 18, 35, 31, 22, 27, 36, 26, -1, -1, 39, 31, 33, 13, 22, 17, 24, 32, 24, 30, 31, -1, 8 };
144+
vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(3, Arg2, costs(Arg0, Arg1)); }
145+
void test_case_4() {
146+
string Arr0[] = {"8-18 4-11 15-5 7-12 11-8 0-15 15-2 3-11 4-18 2-3",
147+
"16-2 18-3 15-18 11-19 18-2 18-7 19-17 3-15 12-19",
148+
"2-17 0-12 1-2 14-12 6-2 4-2 11-5 4-11 11-6 17-16",
149+
"0-18 13-18 16-0 3-7 14-12 3-1 19-18 3-19 10-3 8-15",
150+
"18-19 3-16 13-6 0-19 12-14 5-17 1-12 7-13 9-14 1-2",
151+
"14-5 17-9 2-10 16-13 11-15 10-17 14-10 0-14 2-13",
152+
"4-5 0-17 6-9 17-7 12-6 5-6 6-18 10-18 0-2 13-0 8-4",
153+
"3-12 4-11 10-17 13-12 3-0 3-7 13-0 9-15 10-9 0-10" };
154+
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
155+
string Arr1[] = {"592 219 88 529 324 86 503 610",
156+
"2 94 8 600 34 95 6 494",
157+
"638 301 10 246 290 97 85 74",
158+
"118 8 939 393 450 79 317 99",
159+
"99 806 698 740 2 26 525 818",
160+
"95 9 615 972 23 23 5 666",
161+
"6 448 440 710 83 4 419 496",
162+
"4 47 182 4 185 70 718 770",
163+
"3 321 6 855 968 65 10 6",
164+
"173 224 300 3 79 2 707 49",
165+
"21 10 7 10 4 9 5 8",
166+
"6 600 4 724 7 1 960 247",
167+
"83 16 901 50 437 780 658 2",
168+
"763 923 125 576 45 423 3 1",
169+
"7 324 391 898 8 59 281 973",
170+
"9 44 49 364 78 744 43 5",
171+
"10 62 75 418 216 90 32 919",
172+
"764 534 778 605 80 647 821 74",
173+
"65 449 102 867 421 94 6 7",
174+
"67 155 362 789 189 316 107 595" }
175+
; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0])));
176+
int Arr2[] = { 170, 160, 155, 173, 145, 150, 158, 168, 153, 145, 162, 88, 162, 86, 163, 159, 153, 150, 104 };
177+
vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(4, Arg2, costs(Arg0, Arg1)); }
178+
179+
// END CUT HERE
180+
181+
};
182+
183+
// BEGIN CUT HERE
184+
int main(){
185+
186+
IslandFerries ___test;
187+
___test.run_test(-1);
188+
}
189+
// END CUT HERE

‎IslandFerries.html

Lines changed: 64 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,64 @@
1+
<html><body bgcolor="#000000" text="#ffffff"><table><tr><td colspan="2"><h3>Problem Statement</h3></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><p>
2+
You are a traveler in a chain of tropical islands in the South Pacific. Transportation between these islands is provided by competing ferry services. One-way tickets for the ferries can be purchased on each of the islands. The tickets are only accepted by the ferry service for which the ticket was purchased. Each ticket entitles you to ride any single leg offered by that ferry service, where a leg is a trip between any two islands.
3+
</p>
4+
<p>
5+
Ticket prices vary from island to island, and are published daily in the local newspaper. Armed with the current prices, you wish to decide which island to visit next. Your task is to determine for each island the cheapest path to journey from your current location to that island. You are not concerned with the number of ferries you must ride, only with the cost of the tickets required to make each journey.
6+
</p>
7+
<p>
8+
Anti-competitive regulations prohibit you from carrying more than one ticket for the same ferry service, and from carrying more than three tickets total. Thus, after stepping off a ferry onto an island, you will have zero, one, or two tickets in your possession, and any tickets you are carrying will not be for the ferry you just rode. You begin with no tickets in your possession, so the first step of any journey must be to purchase one, two, or three tickets on the initial island (island 0).
9+
</p>
10+
<p>
11+
The available legs will be given as a vector &lt;string&gt; <b>legs</b>, with each element giving the legs offered by a particular ferry service. The size of <b>legs</b> gives you the number of ferry services. Each element of <b>legs</b> will be formatted as a list of &quot;&lt;island1&gt;-&lt;island2&gt;&quot; (representing a one-way leg from &lt;island1&gt; to &lt;island2&gt;), each separated by a single space.
12+
</p>
13+
<p>
14+
The prices of ferry tickets sold on each island is given as a vector &lt;string&gt; <b>prices</b>, with each element giving the prices for tickets on a particular island. The size of <b>prices</b> gives you the number of islands. Each element of <b>prices</b> will be a space-separated list of integers, corresponding to the ticket prices for ferries in the same order they are given in <b>legs</b>.
15+
</p>
16+
<p>
17+
There will be up to 40 islands and 10 ferry services. Given the list of legs offered by each ferry service and the prices of tickets on each island, for each island compute the cost of traveling there from your initial island (island 0), and return the costs as a vector &lt;int&gt;. The size of your returned vector &lt;int&gt; should be one less than the number of islands. If a given island is unreachable, return -1 for the cost to that island.
18+
</p>
19+
20+
</td></tr><tr><td colspan="2"><h3>Definition</h3></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td>Class:</td><td>IslandFerries</td></tr><tr><td>Method:</td><td>costs</td></tr><tr><td>Parameters:</td><td>vector &lt;string&gt;, vector &lt;string&gt;</td></tr><tr><td>Returns:</td><td>vector &lt;int&gt;</td></tr><tr><td>Method signature:</td><td>vector &lt;int&gt; costs(vector &lt;string&gt; legs, vector &lt;string&gt; prices)</td></tr><tr><td colspan="2">(be sure your method is public)</td></tr></table></td></tr><tr><td colspan="2"><h3>Limits</h3></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td>Time limit (s):</td><td>2.000</td></tr><tr><td>Memory limit (MB):</td><td>64</td></tr></table></td></tr><tr><td colspan="2"><h3>Notes</h3></td></tr><tr><td align="center" valign="top">-</td><td>There is not necessarily a route to all islands.</td></tr><tr><td align="center" valign="top">-</td><td>The cheapest route may including visiting an island more than once (see example 2 below).</td></tr><tr><td colspan="2"><h3>Constraints</h3></td></tr><tr><td align="center" valign="top">-</td><td><b>legs</b> will contain between 1 and 10 elements, inclusive. The size of <b>legs</b> gives you F, the number of ferry services.</td></tr><tr><td align="center" valign="top">-</td><td><b>prices</b> will contain between 2 and 40 elements, inclusive. The size of <b>prices</b> gives you I, the number of islands.</td></tr><tr><td align="center" valign="top">-</td><td>Each element of <b>legs</b> will contain between 1 and 50 characters, inclusive.</td></tr><tr><td align="center" valign="top">-</td><td>Each element of <b>prices</b> will contain between 1 and 50 characters, inclusive.</td></tr><tr><td align="center" valign="top">-</td><td>Each &lt;island&gt; in <b>legs</b> will be an integer between 0 and I-1, inclusive.</td></tr><tr><td align="center" valign="top">-</td><td>Each element of <b>prices</b> will contain F integers between 1 and 1000, inclusive.</td></tr><tr><td align="center" valign="top">-</td><td>There will be no duplicates within a given element of <b>legs</b>.</td></tr><tr><td align="center" valign="top">-</td><td>The <i>j</i>th element in the list of <b>prices[i]</b> gives the price of a ticket for ferry service <i>j</i> sold on island <i>i</i>.</td></tr><tr><td align="center" valign="top">-</td><td>No integers will have leading zeros.</td></tr><tr><td colspan="2"><h3>Examples</h3></td></tr><tr><td align="center" nowrap="true">0)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{ &quot;0-1 0-3&quot;, &quot;0-2&quot; }</pre></td></tr><tr><td><pre>{ &quot;5 7&quot;, &quot;1000 1000&quot;, &quot;1000 1000&quot;, &quot;1000 1000&quot; }</pre></td></tr></table></td></tr><tr><td><pre>Returns: { 5, 7, 5 }</pre></td></tr><tr><td><table><tr><td colspan="2">You need an A ticket (cost of 5) to get to islands 1 and 3, and a B ticket (cost of 7) to get to island 2.
21+
</td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">1)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{ &quot;0-1 1-2 2-3&quot;, &quot;0-1 2-3&quot; }</pre></td></tr><tr><td><pre>{ &quot;1 10&quot;, &quot;20 25&quot;, &quot;50 50&quot;, &quot;1000 1000&quot;, &quot;1000 1000&quot; }</pre></td></tr></table></td></tr><tr><td><pre>Returns: { 1, 11, 31, -1 }</pre></td></tr><tr><td><table><tr><td colspan="2"><p>
22+
There are 5 islands and 2 ferry services. Referring to the ferry services as A and B, the cheapest way to get to island 1 is to purchase an A ticket on island 0 for a cost of 1 and take the A ferry to island 1.
23+
</p>
24+
<p>
25+
The cheapest way to get to island 2 is to purchase A and B tickets on island 0 for a total cost of 11. Use the B ticket to get to island 1 and the A ticket to get to island 2.
26+
</p>
27+
<p>
28+
The cheapest way to get to island 3 is to purchase A and B tickets on island 0 (cost of 11), use the A ticket to get to island 1, purchase another A ticket on island 1 (cost of 20), use it to get to island 2, and then use the B ticket to get to island 3. The total cost is 31.
29+
</p>
30+
<p>
31+
There is no path to island 4.
32+
</p></td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">2)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{ &quot;0-1&quot;, &quot;1-0&quot;, &quot;0-2&quot;, &quot;2-3&quot; }</pre></td></tr><tr><td><pre>{ &quot;1 1 1000 1000&quot;, &quot;1000 1000 10 100&quot;, &quot;1000 1000 1000 1000&quot;, &quot;1000 1000 1000 1000&quot; }</pre></td></tr></table></td></tr><tr><td><pre>Returns: { 1, 12, 112 }</pre></td></tr><tr><td><table><tr><td colspan="2">The cheapest way to get to island 3 is to purchase A and B tickets on island 0, take the A ferry to island 1, purchase C and D tickets on island 1, take the B ferry <i>back</i> to island 0, then the C ferry to island 2, and then the D ferry to island 3.</td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">3)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{ &quot;1-0&quot; }
33+
</pre></td></tr><tr><td><pre>{ &quot;793&quot;, &quot;350&quot; }
34+
</pre></td></tr></table></td></tr><tr><td><pre>Returns: { -1 }</pre></td></tr><tr><td><table><tr><td colspan="2">Legs are directed.</td></tr></table></td></tr></table></td></tr><tr><td align="center" nowrap="true">4)</td><td></td></tr><tr><td>&#160;&#160;&#160;&#160;</td><td><table><tr><td><table><tr><td><pre>{&quot;8-18 4-11 15-5 7-12 11-8 0-15 15-2 3-11 4-18 2-3&quot;,
35+
&quot;16-2 18-3 15-18 11-19 18-2 18-7 19-17 3-15 12-19&quot;,
36+
&quot;2-17 0-12 1-2 14-12 6-2 4-2 11-5 4-11 11-6 17-16&quot;,
37+
&quot;0-18 13-18 16-0 3-7 14-12 3-1 19-18 3-19 10-3 8-15&quot;,
38+
&quot;18-19 3-16 13-6 0-19 12-14 5-17 1-12 7-13 9-14 1-2&quot;,
39+
&quot;14-5 17-9 2-10 16-13 11-15 10-17 14-10 0-14 2-13&quot;,
40+
&quot;4-5 0-17 6-9 17-7 12-6 5-6 6-18 10-18 0-2 13-0 8-4&quot;,
41+
&quot;3-12 4-11 10-17 13-12 3-0 3-7 13-0 9-15 10-9 0-10&quot; }
42+
</pre></td></tr><tr><td><pre>{&quot;592 219 88 529 324 86 503 610&quot;,
43+
&quot;2 94 8 600 34 95 6 494&quot;,
44+
&quot;638 301 10 246 290 97 85 74&quot;,
45+
&quot;118 8 939 393 450 79 317 99&quot;,
46+
&quot;99 806 698 740 2 26 525 818&quot;,
47+
&quot;95 9 615 972 23 23 5 666&quot;,
48+
&quot;6 448 440 710 83 4 419 496&quot;,
49+
&quot;4 47 182 4 185 70 718 770&quot;,
50+
&quot;3 321 6 855 968 65 10 6&quot;,
51+
&quot;173 224 300 3 79 2 707 49&quot;,
52+
&quot;21 10 7 10 4 9 5 8&quot;,
53+
&quot;6 600 4 724 7 1 960 247&quot;,
54+
&quot;83 16 901 50 437 780 658 2&quot;,
55+
&quot;763 923 125 576 45 423 3 1&quot;,
56+
&quot;7 324 391 898 8 59 281 973&quot;,
57+
&quot;9 44 49 364 78 744 43 5&quot;,
58+
&quot;10 62 75 418 216 90 32 919&quot;,
59+
&quot;764 534 778 605 80 647 821 74&quot;,
60+
&quot;65 449 102 867 421 94 6 7&quot;,
61+
&quot;67 155 362 789 189 316 107 595&quot; }
62+
</pre></td></tr></table></td></tr><tr><td><pre>Returns:
63+
{ 170, 160, 155, 173, 145, 150, 158, 168, 153, 145, 162, 88,
64+
162, 86, 163, 159, 153, 150, 104 }</pre></td></tr><tr><td></td></tr></table></td></tr></table><p>This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved. </p></body></html>

0 commit comments

Comments
 (0)