#P1400. [CERC2016] Easy Equation
[CERC2016] Easy Equation
题目描述
Given an integer greater than , it is possible to prove that there are infinitely many triples of positive integers that satisfy the following equation:
Given positive integers and , find arbitrary triples $(a_1, b_1, c_1), (a_2, b_2, c_2), \cdots , (a_n, b_n, c_n)$ that all satisfy the equation. Furthermore, all integers $(a_1, b_1, c_1), (a_2, b_2, c_2), \cdots , (a_n, b_n, c_n)$ should be different positive integers with at most decimal digits each.
输入格式
The first line contains two integers and — the constant k in the equation and the target number of triples.
输出格式
Output lines. The -th line should contain three space separated integers , and with at most digits each — the -th of the solutions you found.
题目大意
题目描述:
假设 大于 , 可以证明有无穷多个正整数三元组 满足以下方程:
给定正整数 和 ,找出 个三元组 $(a_1, b_1, c_1), (a_2, b_2, c_2), ⋯ ,(a_n, b_n, c_n)$ 使它们都满足方程。另外,这 个正整数 $(a_1, b_1, c_1), (a_2, b_2, c_2), ⋯ ,(a_n, b_n, c_n)$ 应该是不同的,每个数最多有 位。
输入格式:
第一行包含两个整数: 方程中的常数 和 所求三元组的数量 ;
输出格式:
输出有 行。第 行应该包含三个空格分隔的正整数 , 和 , 为你找到的第 个解。每个数最多 位。
2 8
1 2 6
3 10 24
12 35 88
15 28 84
4 5 18
14 33 90
40 104 273
21 60 152
3 3
1 3 12
8 21 87
44 165 615