Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Print all pairs (sets) of prime numbers** (p,q)** such that **p*q <= n**, where **n** is given number.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. T testcases follow.

The first line of each test case is **N**.

**Output:**

For each testcase, in a new line, print the all pairs of prime numbers in increasing order.

**Constraints:**

1 ≤ T ≤ 50

4 ≤ N ≤ 400

**Example:**

**Input**:

2

4

8

**Output:**

2 2

2 2 2 3 3 2

**Explanation:
Testcase 1:** Pair (2, 2) which has both prime numbers as well as satisfying the condition 2*2 <= 4.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Pairs of prime number

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.