tsounakis

3.3

Mar 23rd, 2020
472
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.40 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #define N 10
  4. #define M 20
  5.  
  6. const float right = -5.0, left = 4.0, up = 2.0, down = 3.0;
  7.  
  8. void createL(float t[N][M]);
  9. void createU(float t[N][M]);
  10. void createR(float t[N][M]);
  11. void createD(float t[N][M]);
  12. void calcCorners(float t[N][M]);
  13. void printarray(float*);
  14. void initialize(float t[N][M]);
  15. void denormalize(float t[N][M]);
  16. void loadTemp(float tTemp[N][M], float*);
  17. void normalize(float t[N][M]);
  18. float next(int, int, float t[N][M]);
  19. int round(float);
  20.  
  21. int main() {
  22. float t[N][M], tNew[N][M], tTemp[N][M];
  23. float* ptr;
  24. float* ptrNew;
  25. float* ptrTemp;
  26. int i, j, k;
  27. int time;
  28.  
  29. ptr = &t[0][0];
  30. ptrNew = &tNew[0][0];
  31.  
  32. initialize(t);
  33. normalize(t);
  34. printarray(ptr);
  35. denormalize(t);
  36.  
  37. while(1)
  38. {
  39. ptrTemp = &t[0][0];
  40. printf("Enter an integer for the time: ");
  41. scanf("%d", &time);
  42.  
  43. if (time!=0)
  44. {
  45. loadTemp(tTemp, ptrTemp);
  46. for (k=0; k<time; k++)
  47. {
  48. for (i=0; i<N; i++)
  49. {
  50. if (i != 0 && i != N - 1)
  51. {
  52. for (j=0; j<M; j++)
  53. {
  54. if (j != 0 && j != M - 1)
  55. {
  56. tNew[i][j] = next(i, j, tTemp);
  57. }
  58. }
  59. }
  60. }
  61. createL(tNew);
  62. createR(tNew);
  63. createD(tNew);
  64. createU(tNew);
  65. calcCorners(tNew);
  66. ptrTemp = &tNew[0][0];
  67. loadTemp(tTemp, ptrTemp);
  68. /*normalize(tNew);
  69. printarray(&tTemp[0][0]);*/
  70. }
  71. }
  72. else
  73. {
  74. return 0;
  75. }
  76. normalize(tNew);
  77. printarray(ptrNew);
  78. /* printarray(ptrTemp);*/
  79. }
  80. system("pause");
  81.  
  82. return 0;
  83. }
  84.  
  85. /* i am tired */
  86.  
  87. int round(float num)
  88. {
  89. return num < 0 ? num - 0.5 : num + 0.5;
  90. }
  91.  
  92. void denormalize(float t[N][M])
  93. {
  94. initialize(t);
  95. return;
  96. }
  97.  
  98. void normalize(float t[N][M])
  99. {
  100. int i, j, k;
  101. float min = t[0][0];
  102. for (i=0; i<N; i++)
  103. {
  104. for (j=0; j<M; j++)
  105. {
  106. if (t[i][j] < min)
  107. {
  108. min = t[i][j];
  109. }
  110. }
  111. }
  112. for (i=0; i<N; i++)
  113. {
  114. for (j=0; j<M; j++)
  115. {
  116. for (k=0; k<10; k++)
  117. {
  118. if (t[i][j] >= (k + min) && t[i][j] < (k + 1 + min))
  119. {
  120. t[i][j] = k;
  121. break;
  122. }
  123. }
  124. }
  125. }
  126. return;
  127. }
  128.  
  129. void loadTemp(float tTemp[N][M], float* ptrTemp)
  130. {
  131. int i, j;
  132. for (i=0; i<N; i++)
  133. {
  134. for (j=0; j<M; j++)
  135. {
  136. tTemp[i][j] = *(ptrTemp + M*i + j);
  137. }
  138. }
  139. return;
  140. }
  141.  
  142. void calcCorners(float t[N][M])
  143. {
  144. float ur, ul, dr, dl;
  145. ur = ( right + up ) / 2;
  146. dr = ( right + down ) / 2;
  147. ul = ( left + up ) / 2;
  148. dl = ( left + down ) / 2;
  149. t[0][0] = ul;
  150. t[0][M-1] = ur;
  151. t[N-1][0] = dl;
  152. t[N-1][M-1] = dr;
  153. return;
  154. }
  155.  
  156. void createR(float t[N][M])
  157. {
  158. int i;
  159. for (i=0; i<N; i++)
  160. {
  161. t[i][M-1] = right;
  162. }
  163. return;
  164. }
  165.  
  166. void createL(float t[N][M])
  167. {
  168. int i;
  169. for (i=0; i<N; i++)
  170. {
  171. t[i][0] = left;
  172. }
  173. return;
  174. }
  175.  
  176. void createD(float t[N][M])
  177. {
  178. int i;
  179. for (i=0; i<M; i++)
  180. {
  181. t[N-1][i] = down;
  182. }
  183. return;
  184. }
  185.  
  186. void createU(float t[N][M])
  187. {
  188. int i;
  189. for (i=0; i<M; i++)
  190. {
  191. t[0][i] = up;
  192. }
  193. return;
  194. }
  195.  
  196. void initialize(float t[N][M])
  197. {
  198. int i, j;
  199. printf("Time: 0\n");
  200. for (i=0; i<N; i++)
  201. {
  202. for (j=0; j<M; j++)
  203. {
  204. t[i][j] = 1.0;
  205. }
  206. }
  207. createL(t);
  208. createR(t);
  209. createD(t);
  210. createU(t);
  211. calcCorners(t);
  212. return;
  213. }
  214.  
  215. void printarray(float* pointer)
  216. {
  217. int i, j;
  218. for (i=0; i<N; i++)
  219. {
  220. for (j=0; j<M; j++)
  221. {
  222. printf("%.2f\t", *(pointer + M*i + j));
  223. }
  224. putchar('\n');
  225. }
  226. printf("\n------------------------------------------------------\n");
  227. return;
  228. }
  229.  
  230. float next(int i, int j, float t[N][M])
  231. {
  232. float tNewElement;
  233. tNewElement = 0.1 * (t[i-1][j-1] + t[i-1][j] + t[i-1][j+1] + t[i][j-1] + 2 * t[i][j] + t[i][j+1] + t[i+1][j-1] + t[i+1][j] + t[i+1][j+1]);
  234. return tNewElement;
  235. }
Advertisement
Add Comment
Please, Sign In to add comment