1-> n cities are given and a threshold is given and there is a bi-directional road between x and y if\nx%z==0\ny%z==0\nz>threshold\n\nMake connections and later they will provide different source and target cities, tell whether a road is there or not(road can be indirect as well).\n\nThe solution I gave was run a loop of threshold+1 till n+1, and then make connections with multiplier

1-> n cities are given and a threshold is given and there is a bi-directional road between x and y if\nx%z==0\ny%z==0\nz>threshold\n\nMake connections and later