|
||||||||
Time Limit: 1.0 second Memory Limit: 4 000 KB Vasya’s dad is good in maths. Lately his favorite objects have been "beautiful" directed graphs. Dad calls a graph "beautiful" if all the following conditions are true:
Dad picks a natural number N, stocks up blank paper, and draws a "beautiful" graph on each sheet. He verifies that no two drawn graphs are isomorphic. Given the number N, you are to find the number of sheets that Vasya's dad has to stock up. InputInput contains the single number N (1 ≤ N ≤ 50). OutputOutput the number of "beautiful" graphs with N vertices. Sample InputSample input #1 3 Sample input #2 5 Sample OutputSample output #1 2 Sample output #2 9 Problem Author: Alexander Ipatov Problem Source: Petrozavodsk summer training camp, August 2005. Print Statistic Discuss Submit |
||||||||
|