HackerRank Home Prepare Certify Compete Apply Search 2 Switch to PrepareData StructuresTreesKittys Calculations on a Tree Kittys Calculations on a Tree 8933 more points to get your next star Rank 592330Points 38567475 Problem Solving Your Kittys Calculations on a Tree submission got 000 pointsTry Again Problem Submissions Leaderboard Discussions Editorial HackerRank Logo PrepareData StructuresTreesKittys Calculations on a Tree Exit Full Screen View Problem Submissions Leaderboard Discussions Editorial Kitty has a tree consisting of nodes where each node is uniquely labeled from to Her friend Alex gave her sets where each set contains distinct nodes Kitty needs to calculate the following expression on each set where denotes an unordered pair of nodes belonging to the set denotes the number of edges on the unique shortest path between nodes and Given and sets of distinct nodes calculate the expression for each set For each set of nodes print the value of the expression modulo on a new line Example The graph looks like this image There are three pairs that can be created from the query set The distance from to is from to is and from to is Now do the summation Input Format The first line contains two spaceseparated integers the respective values of the number of nodes in tree and the number of nodes in the query set Each of the subsequent lines contains two spaceseparated integers and that describe an undirected edge between nodes and The subsequent lines define each set over two lines in the following format The first line contains an integer the size of the set The second line contains spaceseparated integers the sets elements Constraints The sum of over all does not exceed All elements in each set are distinct Subtasks for of the maximum score for of the maximum score for of the maximum score Output Format Print lines of output where each line contains the expression for the query modulo Sample Input 0 7 3 1 2 1 3 1 4 3 5 3 6 3 7 2 2 4 1 5 3 2 4 5 Sample Output 0 16 0 106 Explanation 0 Tree looks like this image We perform the following calculations for sets Set Given set the only pair we can form is where We then calculate the following answer and print it on a new line Set Given set we cannot form any pairs because we dont have at least two elements Thus we print on a new line Set Given set we can form the pairs and We then calculate the following answer and print it on a new line Language C More 798081828384858687888990919293949596979899100101 54int main Line 101 Col 1 Test against custom input Compilation error Check the compiler output fix the error and try again Compile Message usrbinld ccMYClg4o in function dfs tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc23text0x8a relocation truncated to fit RX866432S against symbol parent defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc24text0x94 relocation truncated to fit RX866432S against symbol parent defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc26text0xb0 relocation truncated to fit RX866432S against symbol parent defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc26text0xb8 relocation truncated to fit RX866432S against symbol parent defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc32text0xf0 relocation truncated to fit RX866432S against symbol depth defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc32text0x100 relocation truncated to fit RX866432S against symbol depth defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc36text0x125 relocation truncated to fit RX866432S against symbol tout defined in COMMON section in ccMYClg4o usrbinld ccMYClg4o in function isancestor tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc40text0x15b relocation truncated to fit RX866432S against symbol tout defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc40text0x162 relocation truncated to fit RX866432S against symbol tout defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc40text0x18a relocation truncated to fit RX866432S against symbol tout defined in COMMON section in ccMYClg4o usrbinld tmpsubmission202505120809hackerrank834e273f0b54f014d1522e5934aff880codeSolutionc40text0x192 additional relocation