{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003ch1 align\u003d\"center\"\u003e\r\n\t\u0026nbsp;\u003c/h1\u003e\r\n\u003cp\u003e\r\n\tGiven an undirected graph of the following form with \u003cem\u003en\u003c/em\u003e nodes, \u003cem\u003e1 \u0026le; n \u0026le; 76\u003c/em\u003e:\u003cbr /\u003e\r\n\t\u003cbr /\u003e\r\n\t\u003cimg hspace\u003d\"10\" src\u003d\"http://uva.onlinejudge.org/external/110/p11069.png\" /\u003e\u003cbr /\u003e\r\n\t\u003cbr /\u003e\r\n\tYour task is to calculate the number of subsets of nodes of the graph with the following properties:\u003c/p\u003e\r\n\u003cul\u003e\r\n\t\u003cli\u003e\r\n\t\tno nodes in the subset should be connected\u003c/li\u003e\r\n\t\u003cli\u003e\r\n\t\tit shouldn\u0026#39;t be possible to add further nodes to the subset without violating the first condition\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003cp\u003e\r\n\tFor a graph with \u003cem\u003e5\u003c/em\u003e nodes the number of subsets which fulfill the above conditions is \u003cem\u003e4\u003c/em\u003e. The subsets are \u003cem\u003e{1,3,5},{2,4},{2,5},{1,4}\u003c/em\u003e.\u003c/p\u003e\r\n\u003cp\u003e\r\n\t\u0026nbsp;\u003c/p\u003e\r\n\u003cp\u003e\r\n\t\u0026nbsp;\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tInput\u003c/h2\u003e\r\n\u003cp\u003e\r\n\tThe input will consist of a sequence of numbers \u003cem\u003en\u003c/em\u003e,\u003cem\u003e1 \u0026le; n \u0026le; 76\u003c/em\u003e. Each number will be on a separate line. The input will be terminated by \u003cspan data-scayt_word\u003d\"EOF\" data-scaytid\u003d\"1\"\u003eEOF\u003c/span\u003e.\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tOutput\u003c/h2\u003e\r\n\u003cp\u003e\r\n\tOutput the number of subsets as described above on a single line. The number of all subsets will be less than \u003cem\u003e2^31\u003c/em\u003e.\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tSample input\u003c/h2\u003e\r\n\u003cpre\u003e\r\n1\r\n2\r\n3\r\n4\r\n5\r\n30\r\n\u003c/pre\u003e\r\n\u003ch2\u003e\r\n\tSample output\u003c/h2\u003e\r\n\u003cpre\u003e\r\n1\r\n2\r\n2\r\n3\r\n4\r\n4410\r\n\u003c/pre\u003e\r\n\u003cbr clear\u003d\"all\" /\u003e\r\n\u003cbr /\u003e\r\n\u003chr /\u003e\r\n\u003cp\u003e\r\n\tFAU Local Summer Contest 2005\u003cbr /\u003e\r\n\tAuthor: Der General\u003c/p\u003e"}}]}