PAT (Basic Level) - 1103 缘分数

数学

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

int m, n;

int main() {
	scanf("%d %d", &m, &n);

    bool flag = false;
	for (int a = m; a <= n; a++) {
		int sqr = sqrt(pow(a, 3) - pow(a - 1, 3));
		int b = sqrt(sqr / 2) + 1;
		if (pow(a, 3) - pow(a - 1, 3) == pow(pow(b, 2) + pow(b - 1, 2), 2) && a != b) {
			printf("%d %d\n", a, b);
			flag = true;
		}
	}
    
	if (!flag) puts("No Solution");
    
	return 0;
}