2021-10-19训练赛B题题解

最新推荐文章于 2022-08-02 22:06:16 发布

Rediso

最新推荐文章于 2022-08-02 22:06:16 发布

阅读量309

点赞数

文章标签： c语言

本文链接：https://blog.csdn.net/Rediso/article/details/120857154

版权

给定整数n，找到正整数a和b，使得a+b=n且LCM(a,b)最小。通过数学分析，可以使用n的平方根范围进行搜索，找到能被n整除的数i，然后输出n/i和n-n/i作为答案。" 120390590,9558129,深度解析：从Attention到Transformer再到BERT,"['自然语言处理', '机器学习', 'BERT']

摘要由CSDN通过智能技术生成

原题为：CodeForces 1372B - Omkar and Last Class of Math。

B. Omkar and Last Class of Math
time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard output
In Omkar’s last class of math, he learned about the least common multiple, or LCM. LCM(a,b) is the smallest positive integer x which is divisible by both a and b.

Omkar, having a laudably curious mind, immediately thought of a problem involving the LCM operation: given an integer n, find positive integers a and b such that a+b=n and LCM(a,b) is the minimum value possible.

Can you help Omkar solve his ludicrously challenging math problem?

Input
Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤10). Description of the test cases follows.

Each test case consists of a single integer n (2≤n≤109).

Output
For each test case, output two positive intege