ICPC2013予選、A問題をもうちょっとちゃんと解く

A2.cpp

#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
#include <tuple>
#include <math.h>

using namespace std;

const int N = 150;

int main(int argc, char const *argv[]){
	vector<tuple<int, int, int> > rects;

	for (int w = 0; w < N; ++w){
		for (int h = 0; h < w; ++h){
			int d = pow(w+1, 2) + pow(h+1, 2);
			rects.push_back(make_tuple(d, h + 1, w + 1));
		}
	}
	sort(rects.begin(), rects.end());

	while(1){
		int h, w;
		cin >> h >> w;
		if(h == 0 && w == 0) break;
		
		int t = pow(h, 2) + pow(w, 2);
		auto up = upper_bound(rects.begin(), rects.end(), make_tuple(t, h, w));
		cout << get<1>(*up) << " " << get<2>(*up) << endl;
	}

	return 0;
}