1
#include<bits/stdc++.h>
2
using namespace std;
3

4
int main() {
5
  int n, m;
6
  cin >> n >> m;
7
  int sum = 0;
8
  for(int i = 1; i <= n; i++) {
9
    int tmp = 0, x;
10
    for(int j = 1; j <= m; j++) {
11
      cin >> x;
12
      tmp = max(tmp, x);
13
    }
14
    sum += tmp;
15
  }
16
  cout << sum << endl;
17
  return 0;
18
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
int arr[21][21];
5

6
int main() {
7
  int n;
8
  cin >> n;
9
  for(int i = 1; i <= n; i++) {
10
    for(int j = 1; j <= i; j++) {
11
      if(j == 1 || j == i)  arr[i][j] = 1;
12
      else arr[i][j] = arr[i-1][j-1] + arr[i-1][j];
13
    }
14
    for(int j = 1; j <= i; j++) {
15
      printf("%d%c", arr[i][j], (i == j)?'\\n':' ');
16
    }
17
  }
18
  return 0;
19
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
string s[21];
5

6
int main() {
7
  int n;
8
  cin >> n;
9
  for(int i = 1; i <= n; i++)  cin >> s[i];
10
  sort(s+1, s+1+n, [](string s1, string s2) -> bool {
11
    int n = min(s1.size(), s2.size());
12
    for(int i = 0; i < n; i++) {
13
      if(s1[i] > s2[i])  return 1;
14
      else if(s1[i] < s2[i])  return 0;
15
      else  continue;
16
    }
17
    return 1;
18
  });
19
  for(int i = 1; i <= n; i++)  cout << s[i];
20
  return 0;
21
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
int main() {
5
  int n, k;
6
  cin >> n >> k;
7
  map<int, bool> disable;
8
  for(int i = 1; i <= k; i++) {
9
    int x; cin >> x;
10
    disable[x] = 1;
11
  }
12

13
  vector<int> dp(n+1, 0);
14
  dp[0] = 1;
15
  for(int i = 1; i <= n; i++) {
16
    int sum = 0;
17
    if(i - 1 >= 0 && disable[i-1] == 0)  sum += dp[i-1];
18
    if(i - 2 >= 0 && disable[i-2] == 0)  sum += dp[i-2];
19
    if(i - 3 >= 0 && disable[i-3] == 0)  sum += dp[i-3];
20
    if(disable[i] == 0)  dp[i] = sum;
21
    else  dp[i] = 0;
22
  }
23
  cout << dp[n] << endl;
24
  return 0;
25
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
int main() {
5
  map<int, bool> one;
6
  one[1] = 1;
7
  int x = 1, p = 1;
8
  while(x <= 1e9) {
9
    one[x+p] = 1;
10
    x += p;
11
    p++;
12
  }
13
  int n;
14
  cin >> n;
15
  while(n--) {
16
    cin >> x;
17
    cout << one[x] << endl;
18
  }
19
  return 0;
20
}
21

22
/*
23
1 2 4 7 11
24
*/

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
int main() {
5
  int n, m, k;
6
  cin >> n >> m >> k;
7
  int i = 0, j = 0;
8
  while(k--) {
9
    cout << i + 1 << ' ' << j + 1 << endl;
10
    i++; i %= n;
11
    j++; j %= m;
12
  }
13
  return 0;
14
}

1
a = [int(x) for x in input().split()]
2
print(max(a[1:]))

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
int main() {
5
  int n;
6
  cin >> n;
7
  for(int i = 7; i >= 0; i--)  cout << ((n>>i)&1);
8
  return 0;
9
}

1
s = input()
2
count = 0
3
for i in range(len(s)):
4
  count += ('0' <=s[i] <= '9')
5
print(count)

1
arr = [int(x) for x in input().split()][1:]
2
arr = sorted(arr)
3
# print(arr)
4
ans = 0x7f7f7f7f
5
for i in range(1, len(arr)):
6
  ans = min(ans, arr[i] - arr[i-1])
7
print(ans)

1
arr = [int(x) for x in input().split()][1:]
2
arr.sort()
3
arr = arr[::-1]
4
arr.sort(key = lambda x: abs(x))
5
arr = arr[::-1]
6
print(','.join([str(x) for x in arr]))

1
import struct
2
f = float(input())
3
m = struct.pack('d', f).hex()
4
m = str(m).upper()
5
m = [m[i*2:i*2+2] for i in range(0, 8)][::-1]
6
m = '-'.join(m)
7
print(m)