Square Friends

查看题解 查看答案
题目描述
Time Limit: 1000 ms
Memory Limit: 256 mb

请先登录再刷题,不会做的题目右上可以查看题解和答案~

输入输出格式
输入描述:
Each input file contains one test case. Each case gives 2 positive integers: n (≤100) and MaxA (≤10^6), as specified in the problem description.
输出描述:
Output all the Square Friends within the range where A≤MaxA. Each pair occupies a line in the format A B. If the solution is not unique, print in the non-decreasing order of A; and if there is still a tie, print in the increasing order of B with the same A. Print No Solution. if there is no solution.
输入输出样例
输入样例#:
3 85
输出样例#:
复制
73 272
78 281
82 288
85 293
题目来源
浙江大学2021年机试题
重置

提交代码后在此处可查看状态