很直白的一道题
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <assert.h>
#include <algorithm>
#include <math.h>
#include <ctime>
#include <functional>
#include <string.h>
#include <stdio.h>
#include <numeric>
#include <float.h>
using namespace std;
int main() {
int n = 0;
while (cin >> n) {
if (n == 0) break;
int i = 1;
while (i * i < n) {
i++;
}
int row, col;
if (i % 2 == 0) {
row = i; col = 1;
int num = (i - 1) * (i - 1);
if ((n - num) <= ((i * i - (i-1) * (i-1)) / 2 + 1)) {
col = (n - num);
}
else {
col = i;
row = i - (n - num - i);
}
}
else {
col = i; row = 1;
int num = (i - 1) * (i - 1);
if (n - num <= ((i * i - num) / 2 + 1) ) {
row = n - num;
}
else {
row = i;
col = i - (n - num - i);
}
}
cout << col << " " << row << endl;
}
return 0;
}