欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1765M.Minimum LCM
Minimum LCM
You are given an integer .
Your task is to find two positive (greater than ) integers and such that and the least common multiple (LCM) of and is the minimum among all possible values of and . If there are multiple answers, you can print any of them.
Input
The first line contains a single integer () — the number of test cases.
The first line of each test case contains a single integer ().
Output
For each test case, print two positive integers and — the answer to the problem. If there are multiple answers, you can print any of them.
Note
In the second example, there are possible pairs of and :
- , , ;
- , , ;
- , , ;
- , , ;
- , , ;
- , , ;
- , , ;
- , , .
In the third example, there are possible pairs of and :
- , , ;
- , , ;
- , , ;
- , , .
Samples
4
2
9
5
10
1 1
3 6
1 4
5 5
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |