Advertisement
Guest User

Untitled

a guest
Mar 28th, 2017
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.96 KB | None | 0 0
  1. #pragma warning(disable:4996)
  2.  
  3. #include <math.h>
  4. #include <stdio.h>
  5. #include <string.h>
  6. #include <stdlib.h>
  7. #include <assert.h>
  8. #include <limits.h>
  9. #include <stdbool.h>
  10.  
  11. #define SWAP(a,b) {int t; t = a; a=b; b = t; }
  12.  
  13. int main(void) {
  14. int arr[6][6];
  15.  
  16. for (int arr_i = 0; arr_i < 6; arr_i++) {
  17. for (int arr_j = 0; arr_j < 6; arr_j++) {
  18.  
  19. scanf("%d", &arr[arr_i][arr_j]);
  20. }
  21. }
  22. int hoursum = 0, max = 0, y = 0;
  23. int sum[16] = { 0, }, index = 0;;
  24.  
  25. for (int i = 0; i <= 3; i++) {
  26. for (int j = 0; j <= 3; j++) {
  27. hoursum = 0;
  28. //hourglass 합
  29.  
  30. for (y = 0; y <= 2; y++) {
  31. hoursum += arr[i][j + y];
  32. hoursum += arr[i + 2][j + y];
  33. }
  34.  
  35. hoursum += arr[i + 1][j + 1];
  36. printf("into to %d point\n", hoursum);
  37. sum[index] = hoursum;
  38.  
  39. index++;
  40.  
  41. }
  42. }
  43. printf("index = %d\n", index);
  44.  
  45. printf("into to 3 point\n");
  46. for (int k = 0; k < index-1; k++) {
  47. if (sum[k] > sum[k + 1]) SWAP(sum[k], sum[k + 1]);
  48. }
  49. printf("max ===== %d\n", sum[15]);
  50. return 0;
  51. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement