Miracle Corporations has a number of system services running in a distributed computer system which
is a prime target for hackers. The system is basically a set of N computer nodes with each of them
running a set of N services. Note that, the set of services running on every node is same everywhere
in the network. A hacker can destroy a service by running a specialized exploit for that service in all
the nodes.
One day, a smart hacker collects necessary exploits for all these N services and launches an attack
on the system. He nds a security hole that gives him just enough time to run a single exploit in each
computer. These exploits have the characteristic that, its successfully infects the computer where it
was originally run and all the neighbor computers of that node.
Given a network description, nd the maximum number of services that the hacker can damage.
Input
There will be multiple test cases in the input le. A test case begins with an integer N (1 N 16),
the number of nodes in the network. The nodes are denoted by 0 to N
在一个包含N个节点和每个节点运行相同N个服务的分布式计算机系统中，一名黑客收集了针对这些服务的所有必要攻击手段，并利用单一的安全漏洞发起攻击。攻击手段能够在原始节点及其邻居节点上成功感染并破坏服务。本问题探讨如何计算黑客最多能破坏多少服务。
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
1259
