Computer Programming Contest Preparation

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



/home/toolbox/public_html/solutions/101/10161/c.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 
   63     DEBUG printf("DEBUG (n %d)\n", n);
   64     l = sqrt((double) n);
   65     sq = l * l;
   66     if (sq == n)
   67         {
   68             /* input is a square */
   69             /* if l is odd, l * l is odd, if l is even, then l * l is even */
   70             if (0 == (l % 2))
   71                 {
   72                     /* even number */
   73                     printf("%d 1\n", l);
   74                 } /* even number */
   75             else
   76                 {
   77                     /* odd number */
   78                     printf("1 %d\n", l);
   79                 } /* odd number */
   80         } /* input is a square */
   81     else
   82         {
   83             /* not a square */
   84             if (0 == (l % 2))
   85                 {
   86                     /* even number */
   87                     lower = sq + 1;
   88                     col = l + 1;
   89                     row = 1;
   90                     cnt = 0;
   91                     fnd = (lower == n);
   92                     while (! fnd)
   93                         {
   94                             /* while */
   95                             DEBUG printf("DEBUG (row %d) (col %d) (cnt %d) (lower %d)\n", row, col, cnt, lower);
   96                             lower++;
   97                             cnt++;
   98                             if (cnt <= l)
   99                                 {
  100                                     /* going up rows */
  101                                     row++;
  102                                 } /* going up rows */
  103                             else
  104                                 {
  105                                     /* going back through columns */
  106                                     col--;
  107                                 } /* going back through columns */
  108                             fnd = (lower == n);
  109                         } /* while */
  110                     printf("%d %d\n", col, row);
  111                 } /* even number */
  112             else
  113                 {
  114                     /* odd number */
  115                     lower = sq + 1;
  116                     col = 1;
  117                     row = l + 1;
  118                     cnt = 0;
  119                     fnd = (lower == n);
  120                     while (! fnd)
  121                         {
  122                             /* while */
  123                             DEBUG printf("DEBUG (row %d) (col %d) (cnt %d) (lower %d)\n", row, col, cnt, lower);
  124                             lower++;
  125                             cnt++;
  126                             if (cnt <= l)
  127                                 {
  128                                     /* going up rows */
  129                                     col++;
  130                                 } /* going up rows */
  131                             else
  132                                 {
  133                                     /* going back through columns */
  134                                     row--;
  135                                 } /* going back through columns */
  136                             fnd = (lower == n);
  137                         } /* while */
  138                     printf("%d %d\n", col, row);
  139                     DEBUG printf("1 %d\n", lower);
  140                 } /* odd number */
  141         } /* not a square */
  142 } /* FUNCTION process */
  143 
  144 int main()
  145 {
  146     /* main */
  147     int moreToDo;
  148 
  149     init();
  150     moreToDo = getInput();
  151     while (moreToDo)
  152         {
  153             /* while */
  154             process();
  155             moreToDo = getInput();
  156         } /* while */
  157 
  158     return EXIT_SUCCESS;
  159 } /* main */
  160