Submission #1162969

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
const int inf = 1e9;
const int mod = 1e9+7;

int R, C, D;
ll powMod(int a, int n, int m){
  ll pro = 1, tmp = a;
  for(; n > 0; n >>= 1){
    if(n & 1) pro = (pro * tmp) % m;
    tmp = tmp * tmp % m;
  }
  return pro;
}
main(){
  int ans, k;
  int b;
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> R >> C >> D;
  b = D % 2;
  ans = 0;
  FOR(i, 0, R){
    FOR(j, 0, C){
      cin >> k;
      if((i + j <= D)&&((i + j) % 2 == b)) ans = max(ans, k);
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result