{"id":282,"date":"2008-01-02T12:38:52","date_gmt":"2008-01-02T12:38:52","guid":{"rendered":"http:\/\/pchero21.com\/?p=282"},"modified":"2008-01-02T12:38:52","modified_gmt":"2008-01-02T12:38:52","slug":"%eb%8b%ac%ed%8c%bd%ec%9d%b4-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98","status":"publish","type":"post","link":"http:\/\/pchero21.com\/?p=282","title":{"rendered":"\ub2ec\ud33d\uc774 \uc54c\uace0\ub9ac\uc998"},"content":{"rendered":"

 \uc22b\uc790\ub97c \uc785\ub825\ud558\uba74 N * N \ud06c\uae30\uc758 \ud589\ub82c\uc774 \ub9cc\ub4e4\uc5b4\uc9c0\uace0, \uc22b\uc790\uac00 \ub2ec\ud33d\uc774 \ub4f1\uaecd\uc9c8\ucc98\ub7fc \uc785\ub825\ub418\ub294 \uc7ac\ubbf8\uc788\ub294 \uc54c\uace0\ub9ac\uc998.<\/p>\n

\nSnail_Algotithms<\/span> (Language : c)<\/span><\/legend>\n
    \n
  1. \n
       1<\/span>.<\/div>\n<\/li>\n
  2. \n
          \/***************************************************************************<\/span><\/div>\n<\/li>\n
  3. \n
       2.<\/span><\/div>\n<\/li>\n
  4. \n
          *            Snail_Algorithms.c<\/span><\/div>\n<\/li>\n
  5. \n
       3.<\/span><\/div>\n<\/li>\n
  6. \n
          *<\/span><\/div>\n<\/li>\n
  7. \n
       4.<\/span><\/div>\n<\/li>\n
  8. \n
          *  Wed Jan  2 16:45:57 2008<\/span><\/div>\n<\/li>\n
  9. \n
       5.<\/span><\/div>\n<\/li>\n
  10. \n
          *  Copyright  2008  pchero21<\/span><\/div>\n<\/li>\n
  11. \n
       6.<\/span><\/div>\n<\/li>\n
  12. \n
          *  pchero21@gmail.com<\/span><\/div>\n<\/li>\n
  13. \n
       7.<\/span><\/div>\n<\/li>\n
  14. \n
          ****************************************************************************\/<\/span><\/div>\n<\/li>\n
  15. \n
       8<\/span>.<\/div>\n<\/li>\n
  16. \n
           <\/div>\n<\/li>\n
  17. \n
       9<\/span>.<\/div>\n<\/li>\n
  18. \n
          \/*<\/span><\/div>\n<\/li>\n
  19. \n
      10.<\/span><\/div>\n<\/li>\n
  20. \n
          *  This program is free software; you can redistribute it and\/or modify<\/span><\/div>\n<\/li>\n
  21. \n
      11.<\/span><\/div>\n<\/li>\n
  22. \n
          *  it under the terms of the GNU General Public License as published by<\/span><\/div>\n<\/li>\n
  23. \n
      12.<\/span><\/div>\n<\/li>\n
  24. \n
          *  the Free Software Foundation; either version 2 of the License, or<\/span><\/div>\n<\/li>\n
  25. \n
      13.<\/span><\/div>\n<\/li>\n
  26. \n
          *  (at your option) any later version.<\/span><\/div>\n<\/li>\n
  27. \n
      14.<\/span><\/div>\n<\/li>\n
  28. \n
          *<\/span><\/div>\n<\/li>\n
  29. \n
      15.<\/span><\/div>\n<\/li>\n
  30. \n
          *  This program is distributed in the hope that it will be useful,<\/span><\/div>\n<\/li>\n
  31. \n
      16.<\/span><\/div>\n<\/li>\n
  32. \n
          *  but WITHOUT ANY WARRANTY; without even the implied warranty of<\/span><\/div>\n<\/li>\n
  33. \n
      17.<\/span><\/div>\n<\/li>\n
  34. \n
          *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the<\/span><\/div>\n<\/li>\n
  35. \n
      18.<\/span><\/div>\n<\/li>\n
  36. \n
          *  GNU General Public License for more details.<\/span><\/div>\n<\/li>\n
  37. \n
      19.<\/span><\/div>\n<\/li>\n
  38. \n
          *<\/span><\/div>\n<\/li>\n
  39. \n
      20.<\/span><\/div>\n<\/li>\n
  40. \n
          *  You should have received a copy of the GNU General Public License<\/span><\/div>\n<\/li>\n
  41. \n
      21.<\/span><\/div>\n<\/li>\n
  42. \n
          *  along with this program; if not, write to the Free Software<\/span><\/div>\n<\/li>\n
  43. \n
      22.<\/span><\/div>\n<\/li>\n
  44. \n
          *  Foundation, Inc., 59 Temple Place – Suite 330, Boston, MA 02111-1307, USA.<\/span><\/div>\n<\/li>\n
  45. \n
      23.<\/span><\/div>\n<\/li>\n
  46. \n
          *\/<\/span><\/div>\n<\/li>\n
  47. \n
      24<\/span>.<\/div>\n<\/li>\n
  48. \n
           <\/div>\n<\/li>\n
  49. \n
      25<\/span>.<\/div>\n<\/li>\n
  50. \n
          #include <stdio.h><\/span><\/div>\n<\/li>\n
  51. \n
      26<\/span>.<\/div>\n<\/li>\n
  52. \n
          #include <math.h><\/span><\/div>\n<\/li>\n
  53. \n
      27<\/span>.<\/div>\n<\/li>\n
  54. \n
           <\/div>\n<\/li>\n
  55. \n
      28<\/span>.<\/div>\n<\/li>\n
  56. \n
          void<\/span> array_rotation(<\/span>int<\/span> size, int<\/span> (<\/span>*array)<\/span>[<\/span>size]<\/span>)<\/span>;<\/div>\n<\/li>\n
  57. \n
      29<\/span>.<\/div>\n<\/li>\n
  58. \n
          void<\/span> snail_algorithms(<\/span>int<\/span> size, int<\/span> (<\/span>*array)<\/span>[<\/span>size]<\/span>)<\/span>;<\/div>\n<\/li>\n
  59. \n
      30<\/span>.<\/div>\n<\/li>\n
  60. \n
           <\/div>\n<\/li>\n
  61. \n
      31<\/span>.<\/div>\n<\/li>\n
  62. \n
          int<\/span> main(<\/span>)<\/span><\/div>\n<\/li>\n
  63. \n
      32<\/span>.<\/div>\n<\/li>\n
  64. \n
          {<\/span><\/div>\n<\/li>\n
  65. \n
      33<\/span>.<\/div>\n<\/li>\n
  66. \n
              int<\/span> size;<\/div>\n<\/li>\n
  67. \n
      34<\/span>.<\/div>\n<\/li>\n
  68. \n
              int<\/span> tmp, i, j, k;<\/div>\n<\/li>\n
  69. \n
      35<\/span>.<\/div>\n<\/li>\n
  70. \n
              int<\/span> first, n, size_tmp;<\/div>\n<\/li>\n
  71. \n
      36<\/span>.<\/div>\n<\/li>\n
  72. \n
           <\/div>\n<\/li>\n
  73. \n
      37<\/span>.<\/div>\n<\/li>\n
  74. \n
              printf<\/span><\/a>(<\/span>“n<\/span>insert number : “<\/span>)<\/span>;<\/div>\n<\/li>\n
  75. \n
      38<\/span>.<\/div>\n<\/li>\n
  76. \n
              scanf<\/span>(<\/span>“%d”<\/span>, &size)<\/span>;<\/div>\n<\/li>\n
  77. \n
      39<\/span>.<\/div>\n<\/li>\n
  78. \n
           <\/div>\n<\/li>\n
  79. \n
      40<\/span>.<\/div>\n<\/li>\n
  80. \n
              int<\/span> array[<\/span>size]<\/span>[<\/span>size]<\/span>;<\/div>\n<\/li>\n
  81. \n
      41<\/span>.<\/div>\n<\/li>\n
  82. \n
                 <\/div>\n<\/li>\n
  83. \n
      42<\/span>.<\/div>\n<\/li>\n
  84. \n
              snail_algorithms<\/span>(<\/span>size, array)<\/span>   ;<\/div>\n<\/li>\n
  85. \n
      43<\/span>.<\/div>\n<\/li>\n
  86. \n
           <\/div>\n<\/li>\n
  87. \n
      44<\/span>.<\/div>\n<\/li>\n
  88. \n
              for<\/span>(<\/span>i = 0<\/span>; i < size; i++)<\/span> {<\/span><\/div>\n<\/li>\n
  89. \n
      45<\/span>.<\/div>\n<\/li>\n
  90. \n
                  for<\/span>(<\/span>j = 0<\/span>; j < size; j++)<\/span><\/div>\n<\/li>\n
  91. \n
      46<\/span>.<\/div>\n<\/li>\n
  92. \n
                      printf<\/span><\/a>(<\/span>“%dt<\/span>“<\/span>, array[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>;<\/div>\n<\/li>\n
  93. \n
      47<\/span>.<\/div>\n<\/li>\n
  94. \n
                 <\/div>\n<\/li>\n
  95. \n
      48<\/span>.<\/div>\n<\/li>\n
  96. \n
                  putchar<\/span>(<\/span>‘n<\/span>‘<\/span>)<\/span>;<\/div>\n<\/li>\n
  97. \n
      49<\/span>.<\/div>\n<\/li>\n
  98. \n
              }<\/span><\/div>\n<\/li>\n
  99. \n
      50<\/span>.<\/div>\n<\/li>\n
  100. \n
          }<\/span><\/div>\n<\/li>\n
  101. \n
      51<\/span>.<\/div>\n<\/li>\n
  102. \n
           <\/div>\n<\/li>\n
  103. \n
      52<\/span>.<\/div>\n<\/li>\n
  104. \n
          \/*********************************************************************************************<\/span><\/div>\n<\/li>\n
  105. \n
      53.<\/span><\/div>\n<\/li>\n
  106. \n
          * FUNCTION : array_rotation<\/span><\/div>\n<\/li>\n
  107. \n
      54.<\/span><\/div>\n<\/li>\n
  108. \n
          * DESCRIPTION : \ud589\ub82c\uc758 \ubc29\ud5a5\uc744 90\ub3c4 \ubc14\uafb8\uc5b4 \uc8fc\ub294 \ud568\uc218<\/span><\/div>\n<\/li>\n
  109. \n
      55.<\/span><\/div>\n<\/li>\n
  110. \n
          *********************************************************************************************\/<\/span><\/div>\n<\/li>\n
  111. \n
      56<\/span>.<\/div>\n<\/li>\n
  112. \n
          void<\/span> array_rotation(<\/span>int<\/span> size, int<\/span> (<\/span>*array)<\/span>[<\/span>size]<\/span>)<\/span><\/div>\n<\/li>\n
  113. \n
      57<\/span>.<\/div>\n<\/li>\n
  114. \n
          {<\/span><\/div>\n<\/li>\n
  115. \n
      58<\/span>.<\/div>\n<\/li>\n
  116. \n
              int<\/span> i, j;<\/div>\n<\/li>\n
  117. \n
      59<\/span>.<\/div>\n<\/li>\n
  118. \n
              int<\/span> array_tmp[<\/span>size]<\/span>[<\/span>size]<\/span>;<\/div>\n<\/li>\n
  119. \n
      60<\/span>.<\/div>\n<\/li>\n
  120. \n
           <\/div>\n<\/li>\n
  121. \n
      61<\/span>.<\/div>\n<\/li>\n
  122. \n
              \/\/ array copy<\/span><\/div>\n<\/li>\n
  123. \n
      62<\/span>.<\/div>\n<\/li>\n
  124. \n
              for<\/span>(<\/span>i = 0<\/span>; i < size; i++)<\/span><\/div>\n<\/li>\n
  125. \n
      63<\/span>.<\/div>\n<\/li>\n
  126. \n
                  for<\/span>(<\/span>j = 0<\/span>; j < size; j++)<\/span><\/div>\n<\/li>\n
  127. \n
      64<\/span>.<\/div>\n<\/li>\n
  128. \n
                      array_tmp<\/span>[<\/span>i]<\/span>[<\/span>j]<\/span> = array[<\/span>i]<\/span>[<\/span>j]<\/span>;<\/div>\n<\/li>\n
  129. \n
      65<\/span>.<\/div>\n<\/li>\n
  130. \n
           <\/div>\n<\/li>\n
  131. \n
      66<\/span>.<\/div>\n<\/li>\n
  132. \n
              \/\/ rotate<\/span><\/div>\n<\/li>\n
  133. \n
      67<\/span>.<\/div>\n<\/li>\n
  134. \n
              for<\/span>(<\/span>i = 0<\/span>; i < size; i++)<\/span><\/div>\n<\/li>\n
  135. \n
      68<\/span>.<\/div>\n<\/li>\n
  136. \n
                  for<\/span>(<\/span>j = 0<\/span>; j < size; j++)<\/span><\/div>\n<\/li>\n
  137. \n
      69<\/span>.<\/div>\n<\/li>\n
  138. \n
                      array<\/span>[<\/span>i]<\/span>[<\/span>j]<\/span> = array_tmp[<\/span>j]<\/span>[<\/span>size – i – 1<\/span>]<\/span>;<\/div>\n<\/li>\n
  139. \n
      70<\/span>.<\/div>\n<\/li>\n
  140. \n
                 <\/div>\n<\/li>\n
  141. \n
      71<\/span>.<\/div>\n<\/li>\n
  142. \n
          }<\/span><\/div>\n<\/li>\n
  143. \n
      72<\/span>.<\/div>\n<\/li>\n
  144. \n
           <\/div>\n<\/li>\n
  145. \n
      73<\/span>.<\/div>\n<\/li>\n
  146. \n
          \/*********************************************************************************************<\/span><\/div>\n<\/li>\n
  147. \n
      74.<\/span><\/div>\n<\/li>\n
  148. \n
          * FUNCTION : snail_algorithms<\/span><\/div>\n<\/li>\n
  149. \n
      75.<\/span><\/div>\n<\/li>\n
  150. \n
          * DESCRIPTION : \ub2ec\ud33d\uc774 \uc54c\uace0\ub9ac\uc998. \ud589\ub82c\uc758 \uc22b\uc790 \ubc30\uc5f4\uc744 \ub2ec\ud33d\uc774 \uaecd\uc9c8\ucc98\ub7fc \uc785\ub825\ud55c\ub2e4.<\/span><\/div>\n<\/li>\n
  151. \n
      76.<\/span><\/div>\n<\/li>\n
  152. \n
          *********************************************************************************************\/<\/span><\/div>\n<\/li>\n
  153. \n
      77<\/span>.<\/div>\n<\/li>\n
  154. \n
          void<\/span> snail_algorithms(<\/span>int<\/span> size, int<\/span> (<\/span>*array)<\/span>[<\/span>size]<\/span>)<\/span><\/div>\n<\/li>\n
  155. \n
      78<\/span>.<\/div>\n<\/li>\n
  156. \n
          {<\/span><\/div>\n<\/li>\n
  157. \n
      79<\/span>.<\/div>\n<\/li>\n
  158. \n
              int<\/span> first;<\/div>\n<\/li>\n
  159. \n
      80<\/span>.<\/div>\n<\/li>\n
  160. \n
              int<\/span> number;<\/div>\n<\/li>\n
  161. \n
      81<\/span>.<\/div>\n<\/li>\n
  162. \n
              int<\/span> size_tmp;<\/div>\n<\/li>\n
  163. \n
      82<\/span>.<\/div>\n<\/li>\n
  164. \n
              int<\/span> i, j, k;<\/div>\n<\/li>\n
  165. \n
      83<\/span>.<\/div>\n<\/li>\n
  166. \n
           <\/div>\n<\/li>\n
  167. \n
      84<\/span>.<\/div>\n<\/li>\n
  168. \n
              first<\/span> = 0<\/span>;<\/div>\n<\/li>\n
  169. \n
      85<\/span>.<\/div>\n<\/li>\n
  170. \n
              number<\/span> = 1<\/span>;<\/div>\n<\/li>\n
  171. \n
      86<\/span>.<\/div>\n<\/li>\n
  172. \n
              k<\/span> = 0<\/span>;<\/div>\n<\/li>\n
  173. \n
      87<\/span>.<\/div>\n<\/li>\n
  174. \n
           <\/div>\n<\/li>\n
  175. \n
      88<\/span>.<\/div>\n<\/li>\n
  176. \n
              for<\/span>(<\/span>i = 0<\/span>; i <= ceil(<\/span>size \/ 2<\/span>)<\/span>; i++)<\/span> {<\/span><\/div>\n<\/li>\n
  177. \n
      89<\/span>.<\/div>\n<\/li>\n
  178. \n
                  for<\/span>(<\/span>j = 0<\/span>; j < 4<\/span>; j++)<\/span> {<\/span><\/div>\n<\/li>\n
  179. \n
      90<\/span>.<\/div>\n<\/li>\n
  180. \n
                      if<\/span>(<\/span>first != 0<\/span>)<\/span>  \/\/ \ud589\uc758 \uccab\ubd80\ubd84\uc778\uc9c0 \uac80\uc0ac<\/span><\/div>\n<\/li>\n
  181. \n
      91<\/span>.<\/div>\n<\/li>\n
  182. \n
                          k<\/span> = i + 1<\/span>;<\/div>\n<\/li>\n
  183. \n
      92<\/span>.<\/div>\n<\/li>\n
  184. \n
                      else<\/span>   <\/div>\n<\/li>\n
  185. \n
      93<\/span>.<\/div>\n<\/li>\n
  186. \n
                          k<\/span> = i;<\/div>\n<\/li>\n
  187. \n
      94<\/span>.<\/div>\n<\/li>\n
  188. \n
           <\/div>\n<\/li>\n
  189. \n
      95<\/span>.<\/div>\n<\/li>\n
  190. \n
                      if<\/span>(<\/span>j % 3<\/span> == 0<\/span> && j != 0<\/span>)<\/span>        \/\/ 3\ubc88\uc758 \ub85c\ud14c\uc774\uc158 \ub9c8\ub2e4 \uc0ac\uc774\uc988\uac00 1\uc529 \uc904\uc5b4\ub4e0\ub2e4.<\/span><\/div>\n<\/li>\n
  191. \n
      96<\/span>.<\/div>\n<\/li>\n
  192. \n
                          size_tmp<\/span> = size – i – 1<\/span>;<\/div>\n<\/li>\n
  193. \n
      97<\/span>.<\/div>\n<\/li>\n
  194. \n
                      else<\/span><\/div>\n<\/li>\n
  195. \n
      98<\/span>.<\/div>\n<\/li>\n
  196. \n
                          size_tmp<\/span> = size – i;<\/div>\n<\/li>\n
  197. \n
      99<\/span>.<\/div>\n<\/li>\n
  198. \n
                     <\/div>\n<\/li>\n
  199. \n
     100<\/span>.<\/div>\n<\/li>\n
  200. \n
                      for<\/span>(<\/span>; k < size_tmp; k++)<\/span> {<\/span>  \/\/ \uc2e4\uc81c\uc801\uc73c\ub85c \ubc30\uc5f4\uc5d0 \uac12\uc744 \uc785\ub825\ud558\ub294 \ubd80\ubd84<\/span><\/div>\n<\/li>\n
  201. \n
     101<\/span>.<\/div>\n<\/li>\n
  202. \n
                          array<\/span>[<\/span>i]<\/span>[<\/span>k]<\/span> = number;<\/div>\n<\/li>\n
  203. \n
     102<\/span>.<\/div>\n<\/li>\n
  204. \n
                          number<\/span>++;<\/div>\n<\/li>\n
  205. \n
     103<\/span>.<\/div>\n<\/li>\n
  206. \n
                          first<\/span> = 1<\/span>;<\/div>\n<\/li>\n
  207. \n
     104<\/span>.<\/div>\n<\/li>\n
  208. \n
                      }<\/span><\/div>\n<\/li>\n
  209. \n
     105<\/span>.<\/div>\n<\/li>\n
  210. \n
                  array_rotation<\/span>(<\/span>size, array)<\/span>;<\/div>\n<\/li>\n
  211. \n
     106<\/span>.<\/div>\n<\/li>\n
  212. \n
                  }<\/span><\/div>\n<\/li>\n
  213. \n
     107<\/span>.<\/div>\n<\/li>\n
  214. \n
                  first<\/span> = 0<\/span>;<\/div>\n<\/li>\n
  215. \n
     108<\/span>.<\/div>\n<\/li>\n
  216. \n
              }<\/span><\/div>\n<\/li>\n
  217. \n
     109<\/span>.<\/div>\n<\/li>\n
  218. \n
          }<\/span><\/div>\n<\/li>\n<\/ol>\n<\/fieldset>\n

    XBb3Eb0blW.c<\/a><\/p>\n

    <\/p>\n","protected":false},"excerpt":{"rendered":"

     \uc22b\uc790\ub97c \uc785\ub825\ud558\uba74 N * N \ud06c\uae30\uc758 \ud589\ub82c\uc774 \ub9cc\ub4e4\uc5b4\uc9c0\uace0, \uc22b\uc790\uac00 \ub2ec\ud33d\uc774 \ub4f1\uaecd\uc9c8\ucc98\ub7fc \uc785\ub825\ub418\ub294 \uc7ac\ubbf8\uc788\ub294 \uc54c\uace0\ub9ac\uc998. Snail_Algotithms (Language : c)    1.       \/***************************************************************************    2.       *            Snail_Algorithms.c    3.     … Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[33],"tags":[],"_links":{"self":[{"href":"http:\/\/pchero21.com\/index.php?rest_route=\/wp\/v2\/posts\/282"}],"collection":[{"href":"http:\/\/pchero21.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/pchero21.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/pchero21.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/pchero21.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=282"}],"version-history":[{"count":0,"href":"http:\/\/pchero21.com\/index.php?rest_route=\/wp\/v2\/posts\/282\/revisions"}],"wp:attachment":[{"href":"http:\/\/pchero21.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=282"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/pchero21.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=282"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/pchero21.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=282"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}