Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma warning(disable:4996)
- #include <math.h>
- #include <stdio.h>
- #include <string.h>
- #include <stdlib.h>
- #include <assert.h>
- #include <limits.h>
- #include <stdbool.h>
- #define SWAP(a,b) {int t; t = a; a=b; b = t; }
- int main(void) {
- int arr[6][6];
- for (int arr_i = 0; arr_i < 6; arr_i++) {
- for (int arr_j = 0; arr_j < 6; arr_j++) {
- scanf("%d", &arr[arr_i][arr_j]);
- }
- }
- int hoursum = 0, max = 0, y = 0;
- int sum[16] = { 0, }, index = 0;;
- for (int i = 0; i <= 3; i++) {
- for (int j = 0; j <= 3; j++) {
- hoursum = 0;
- //hourglass 합
- for (y = 0; y <= 2; y++) {
- hoursum += arr[i][j + y];
- hoursum += arr[i + 2][j + y];
- }
- hoursum += arr[i + 1][j + 1];
- printf("into to %d point\n", hoursum);
- sum[index] = hoursum;
- index++;
- }
- }
- printf("index = %d\n", index);
- printf("into to 3 point\n");
- for (int k = 0; k < index-1; k++) {
- if (sum[k] > sum[k + 1]) SWAP(sum[k], sum[k + 1]);
- }
- printf("max ===== %d\n", sum[15]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement