UVA_10920_Spiral_Tap

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;

typedef long long ll;

int size;
ll query;

int main() {
    while(scanf("%d %lld", &size, &query), (size, query)) {
        int half = size / 2;

        ll c = 1, inc = 1;
        int x, y;
        int xa, ya;
        x = y = half;
        while (true) {
            if (c == query) {
                xa = x, ya = y;
                break;
            }

            if (query > c && query <= c + inc) {
                ya = y;
                xa = x - (query - c);
                break;
            }
            else {
                x -= inc;
                c += inc;
            }

            if (query > c && query <= c + inc) {
                xa = x;
                ya = y - (query - c);
                break;
            }
            else {
                y -= inc;
                c += inc;
            }

            inc++;

            if (query > c && query <= c + inc) {
                ya = y;
                xa = x + (query - c);
                break;
            }
            else {
                x += inc;
                c += inc;
            }

            if (query > c && query <= c + inc) {
                xa = x;
                ya = y + (query - c);
                break;
            }
            else {
                y += inc;
                c += inc;
            }

            inc++;
        }
        end:
        printf("Line = %d, column = %d.\n", size-xa, ya+1);
    }
}