Computer Programming Contest Preparation

ToolBox - Source for: 101/10161/a.c



/home/toolbox/public_html/solutions/101/10161/a.c
    1 #include <stdio.h>
    2 #include <string.h>
    3 #include <sys/types.h>
    4 #include <sys/stat.h>
    5 #include <fcntl.h>
    6 #include <stdint.h>
    7 #include <math.h>
    8 #include <stdlib.h>
    9 #include <ctype.h>
   10 
   11 #define TRUE  (1 == 1)
   12 #define FALSE (1 != 1)
   13 
   14 #define DEBUG if (FALSE)
   15 
   16 /*
   17  *  Author: Isaac Traxler
   18  *    Date: 2026-09-19
   19  * Purpose: fun
   20  * Problem: 10161 - Ant on a Chessboard
   21  */
   22 
   23 /*
   24  * This template reads data until a terminating value is reached.
   25  */
   26 
   27 int n;
   28 
   29 void init()
   30 {
   31     /* FUNCTION init */
   32 } /* FUNCTION init */
   33 
   34 void dump()
   35 {
   36     /* FUNCTION dump */
   37 } /* FUNCTION dump */
   38 
   39 int getInput()
   40 {
   41     /* FUNCTION getInput */
   42     int dataReadFlag;
   43 
   44     scanf(" %d ", &n);
   45     dataReadFlag = 0 != n;
   46     return (dataReadFlag);
   47 } /* FUNCTION getInput */
   48 
   49 void process()
   50 {
   51     /* FUNCTION process */
   52     int r; /* row */
   53     int c; /* col */
   54     int cnt; /* count rows or columns */
   55     int fnd;
   56     int l;
   57     int lower;
   58     int upper;
   59     int sq;
   60     int col; /* column of goal */
   61     int row; /* row of goal */
   62     int ri; /* row increment */
   63     int c1; /* column increment */
   64 
   65     DEBUG printf("DEBUG (n %d)\n", n);
   66     l = sqrt((double) n);
   67     sq = l * l;
   68     if (sq == n)
   69         {
   70             /* input is a square */
   71             /* if l is odd, l * l is odd, if l is even, then l * l is even */
   72             if (0 == (l % 2))
   73                 {
   74                     /* even number */
   75                     printf("%d 1\n", l);
   76                 } /* even number */
   77             else
   78                 {
   79                     /* odd number */
   80                     printf("1 %d\n", l);
   81                 } /* odd number */
   82         } /* input is a square */
   83     else
   84         {
   85             /* not a square */
   86             lower = sq + 1;
   87             if (0 == (l % 2))
   88                 {
   89                     /* even number */
   90                     col = l + 1;
   91                     row = 1;
   92                     cnt = 0;
   93                     ri = 1;
   94                     ci = 0;
   95                 } /* even number */
   96             else
   97                 {
   98                     /* odd number */
   99                     col = 1;
  100                     row = l + 1;
  101                     cnt = 0;
  102                     ri = 0;
  103                     ci = 1;
  104                 } /* odd number */
  105             fnd = (lower == n);
  106             while (! fnd)
  107                 {
  108                     /* while */
  109                     DEBUG printf("DEBUG (row %d) (col %d) (cnt %d) (lower %d)\n", row, col, cnt, lower);
  110                     lower++;
  111                     cnt++;
  112                     if (cnt <= l)
  113                         {
  114                             /* going up rows */
  115                             ri = 1;
  116                             ci = 0;
  117                         } /* going up rows */
  118                     else
  119                         {
  120                             /* going back through columns */
  121                             col--;
  122                         } /* going back through columns */
  123                     fnd = (lower == n);
  124                 } /* while */
  125             printf("%d %d\n", col, row);
  126         } /* even number */
  127     else
  128         {
  129             /* odd number */
  130             lower = sq + 1;
  131             col = 1;
  132             row = l + 1;
  133             cnt = 0;
  134             fnd = (lower == n);
  135             while (! fnd)
  136                 {
  137                     /* while */
  138                     DEBUG printf("DEBUG (row %d) (col %d) (cnt %d) (lower %d)\n", row, col, cnt, lower);
  139                     lower++;
  140                     cnt++;
  141                     if (cnt <= l)
  142                         {
  143                             /* going up rows */
  144                             col++;
  145                         } /* going up rows */
  146                     else
  147                         {
  148                             /* going back through columns */
  149                             row--;
  150                         } /* going back through columns */
  151                     fnd = (lower == n);
  152                 } /* while */
  153             printf("%d %d\n", col, row);
  154             DEBUG printf("1 %d\n", lower);
  155         } /* odd number */
  156 } /* not a square */
  157 } /* FUNCTION process */
  158 
  159 int main()
  160 {
  161     /* main */
  162     int moreToDo;
  163 
  164     init();
  165     moreToDo = getInput();
  166     while (moreToDo)
  167         {
  168             /* while */
  169             process();
  170             moreToDo = getInput();
  171         } /* while */
  172 
  173     return EXIT_SUCCESS;
  174 } /* main */
  175