Bee Maja

https://www.acmicpc.net/problem/6575

6575번: Bee Maja

 

예제 : 성공

평가 : 성공

 

//////////////////////////////
// #92 Bee Maja //
// pc ID : 111204 //
//////////////////////////////

#include <stdio.h>

int main()
{

    int inputNumber;

    while (scanf("%d", &inputNumber) != -1)
    { // inputNumber under 100,000
        int sequnceNumber;
        int Array[2];
        int countNumber;
        int x, y;
        int d, m;
        countNumber = 0;
        Array[0] = 0;
        Array[1] = 1;

        for (; Array[1] < 100000;)
            if (inputNumber <= Array[1])
                break;
            else
            {
                Array[0] += 6;
                Array[1] += Array[0];
                countNumber++;
            }
        // countNumber = (x,0)
        sequnceNumber = Array[1];
        sequnceNumber = sequnceNumber - inputNumber;

        if (inputNumber != 1)
        {
            d = sequnceNumber / countNumber;
            m = sequnceNumber % countNumber;
        }
        else
        {
            d = 0;
            m = 0;
        }

        switch (d)
        {
        case 0:
            x = countNumber;
            y = -m;
            break;
        case 1:
            x = countNumber - m;
            y = -countNumber;
            break;
        case 2:
            x = -m;
            y = -countNumber + m;
            break;
        case 3:
            x = -countNumber;
            y = m;
            break;
        case 4:
            x = -countNumber + m;
            y = countNumber;
            break;
        case 5:
            x = m;
            y = countNumber - m;
            break;
        }

        printf("%d %d\n", x, y);
    }
    return 0;
}