ACM (TJU) : 2800

// http://acm.tju.edu.cn/toj/showp2800.html

#include <stdio.h>

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

    while ( dataset-- ) {
        int n;
        scanf ("%d", &n);

        int mid_point = (n * n * n) / n;
        int start;
        int finish;

        if ( n % 2 ) {
            start = mid_point;
            finish = mid_point;

            for ( int i = 0; i < n / 2; i++ ) {
                start -= 2;
                finish += 2;
            }
        }

        else {

            start = mid_point - 1;
            finish = mid_point + 1;

            for ( int i = 1; i < n / 2; i++ ) {
                start -= 2;
                finish += 2;
            }
        }

        printf ("%d %d\n", start, finish);
    }

    return 0;
}

Advertisements