Algorithm/swexpertacademy.com/source/1209.cpp at master · tdm1223/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
// 1209. Sum
// 2019.07.04
#include<iostream>

using namespace std;

int arr[101][101];
int main()
{
	for (int i = 1; i <= 10; i++)
	{
		int t;
		cin >> t;
		int max = 0;
		for (int j = 0; j < 100; j++)
		{
			fill(arr[j], arr[j] + 100, 0);
		}
		for (int j = 0; j < 100; j++)
		{
			for (int k = 0; k < 100; k++)
			{
				cin >> arr[j][k];
			}
		}
		int sum = 0;
		// 행의 합
		for (int j = 0; j < 100; j++)
		{
			sum = 0;
			for (int k = 0; k < 100; k++)
			{
				sum += arr[j][k];
			}
			if (sum > max)
			{
				max = sum;
			}
		}
		// 열의 합
		for (int j = 0; j < 100; j++)
		{
			sum = 0;
			for (int k = 0; k < 100; k++)
			{
				sum += arr[k][j];
			}
			if (sum > max)
			{
				max = sum;
			}
		}
		// 대각선
		sum = 0;
		for (int j = 0; j < 100; j++)
		{
			sum += arr[j][j];
		}
		if (sum > max)
		{
			max = sum;
		}
		// 대각선
		sum = 0;
		for (int j = 0; j < 100; j++)
		{
			sum += arr[j][99 - j];
		}
		if (sum > max)
		{
			max = sum;
		}
		cout << "#" << i << " " << max << endl;
	}
	return 0;
}