DSA Homework 5 - Revizia istoricului

Rhobincu: /* Examples */

2014-04-26T09:13:15Z

Examples

Rhobincu: /* Data Centers */

2014-04-26T09:11:22Z

Data Centers

Rhobincu: /* Examples */

2014-04-26T09:10:18Z

Examples

Rhobincu: /* Examples */

2014-04-26T09:09:32Z

Examples

Rhobincu: /* Examples */

2014-04-26T09:08:32Z

Examples

Rhobincu: /* Examples */

2014-04-26T09:08:15Z

Examples

Rhobincu: /* Examples */

2014-04-26T09:07:55Z

Examples

Rhobincu: /* Examples */

2014-04-26T09:03:23Z

Examples

Rhobincu: Pagină nouă: = Data Centers = Little John is all grown up now and working in a high tech data center. One day, as he got to work, he finds out that hackers attacked his network and managed to dis...

2014-04-26T09:01:25Z

Pagină nouă: = Data Centers = Little John is all grown up now and working in a high tech data center. One day, as he got to work, he finds out that hackers attacked his network and managed to dis...

Pagină nouă

= Data Centers =

Little John is all grown up now and working in a high tech data center. One day, as he got to work, he finds out that hackers attacked his network and managed to disable some of the servers. A disabled server can't route data in or out, so they behave as all links to and from those nodes are disabled. Some of the remaining servers are critical to data access within his company and he wants to know if there is still a route for the data between them.

Help Little John write a program to find out if those servers are still linked.

== Requirement ==

Given a number of servers N and an adjacency matrix NxN specifying the links between those servers, a number K of failed servers, and pair of servers (i, j), specify if there is still a route between server i and server j.

== Input Data ==

A file called ''data_center.in'', containing the number of servers N on the first line and N x N subsequent values, defining the adjacency matrix, arranged in a square, on N lines, followed by the number K of failed servers, K values specifying the servers on the following line, and the pair (i, j) on the last line.

== Output Data ==

A file called ''data_center.out'', containing the value 0 if there is no route between the two specified servers and 1 if there is.

== Restrictions ==
1 ≤ K ≤ N ≤ 1000

== Examples ==

{| class="wikitable"
|- bgcolor="#ddeeff" align="left"
|'''Input''' || '''Output'''
|- bgcolor="#ddffdd" align="left"
|
<pre style="font-size:12px">
8
Mircea
a
mancat
cartofi
si
piure
de
cartofi
</pre>
|
<pre style="font-size:12px">
7
Mircea
a
cartofi
de
mancat
piure
si
</pre>
|}

@@ Linia 44: / Linia 44: @@
+|
 The data center has 5 nodes. There is only 1 failed node: node 2. The critical servers are 0 and 4 and since there is no route between them, the result is 0.
-|-
+|-  bgcolor="#ddffdd" align="left"
 |<pre style="font-size:12px">

@@ Linia 44: / Linia 44: @@
+|
 The data center has 5 nodes. There is only 1 failed node: node 2. The critical servers are 0 and 4 and since there is no route between them, the result is 0.
-||
+|-
-<pre style="font-size:12px">
+|<pre style="font-size:12px">
 1 1 0 0

@@ Linia 52: / Linia 52: @@
 0 1 0 1
 0 1 1 0
-−
 3
 4
 </pre>
@@ Linia 61: / Linia 61: @@
 </pre>
+|
-The data center has 5 nodes. There is only 1 failed node: node 3. The critical servers are 0 and 4 and since there is now a route between them, the result is 1.
+The data center has 5 nodes. There are 2 failed nodes: nodes 1 and 3. The critical servers are 0 and 4 and since there is now a route between them, the result is 1.
 |}

@@ Linia 44: / Linia 44: @@
+|
 The data center has 5 nodes. There is only 1 failed node: node 2. The critical servers are 0 and 4 and since there is no route between them, the result is 0.
-|-
+||
 <pre style="font-size:12px">

@@ Linia 44: / Linia 44: @@
+|
 The data center has 5 nodes. There is only 1 failed node: node 2. The critical servers are 0 and 4 and since there is no route between them, the result is 0.
+|-
 <pre style="font-size:12px">

@@ Linia 1: / Linia 1: @@
 = Data Centers =
-Little John is all grown up now and working in a high tech data center. One day, as he got to work, he finds out that hackers attacked his network and managed to disable some of the servers. A disabled server can't route data in or out, so they behave as all links to and from those nodes are disabled. Some of the remaining servers are critical to data access within his company and he wants to know if there is still a route for the data between them.
+Little John is all grown up now and working in a high tech data center. One day, as he got to work, he finds out that hackers attacked his network and managed to disable some of the servers. A disabled server can't route data in or out, so it behaves as all links to and from it are disabled. Some of the remaining servers are critical to data access within his company and he wants to know if there is still a route for the data between them.
 Help Little John write a program to find out if those servers are still linked.

@@ Linia 24: / Linia 24: @@
 {| class="wikitable"
 |- bgcolor="#ddeeff" align="left"
-|'''Input''' || '''Output'''
+|'''Input''' || '''Output''' || '''Comments'''
 |- bgcolor="#ddffdd" align="left"
+|
@@ Linia 42: / Linia 42: @@
 </pre>
 |}