Count of pairs in range [ P , Q ] with numbers as multiple of R and their product lie in range [ P * Q / 4 , P * Q ] | C # program for the above approach ; Function to find the number of pairs such that both the elements are in the range [ P , Q ] and the numbers should be multiple of R , and the product of numbers should lie in the range [ P * Q / 4 , P * Q ] ; Store multiple of r in range of [ P , Q ] ; Itearte in the range [ p , q ] ; Vector to store pair of answer ; Iterate through the vector v ; Iterate in the range [ i + 1 , v . size ( ) - 1 ] ; If pair follow this condition insert the pair in vector ans ; If no pair satisfy the conditions , print - 1 ; Print the pairs which satisfy the given condition ; Driver Code ; Given Input ; Function Call
using System ; using System . Collections . Generic ; class GFG { static void findPairs ( int p , int q , int r ) { List < int > v = new List < int > ( ) ; for ( int i = p ; i <= q ; i ++ ) { if ( i % r == 0 ) { v . Add ( i ) ; } } List < List < int > > ans = new List < List < int > > ( ) ; for ( int i = 0 ; i < v . Count ; i ++ ) { for ( int j = i + 1 ; j < v . Count ; j ++ ) { if ( v [ i ] * v [ j ] >= p * q / 4 && v [ i ] * v [ j ] <= p * q ) { List < int > temp = new List < int > ( ) ; temp . Add ( v [ i ] ) ; temp . Add ( v [ j ] ) ; ans . Add ( temp ) ; } } } if ( ans . Count == 0 ) { Console . Write ( - 1 ) ; } else { foreach ( List < int > subList in ans ) { foreach ( int item in subList ) { Console . Write ( item + " ▁ " ) ; } Console . WriteLine ( ) ; } } } public static void Main ( ) { int p = 14 , q = 30 , r = 5 ; findPairs ( p , q , r ) ; } }