func_code_string: #include <bits/stdc++.h>   using namespace std;   struct node {     int v, fr;     node(){};     node(int a, int b) { v = a, fr = b; }   } C[115 + 115];   long long f[115 + 115][115], K;   int ar[115 + 115], n, m, P[115][115];   inline bool cmp(node a, node b) { return a.v < b.v; }   inline void pluss(long long &p, long long p1) {     p += p1;     if (p > 2000000000000000011LL) p = 2000000000000000011LL;   }   int main() {     int i, j, e, t, k;     cin >> n >> m >> K;     for (i = 1; i <= n; ++i)       for (j = 1; j <= m; ++j) scanf( %d , &P[i][j]);     for (i = 1; i < n + m; ++i) C[i] = node((~0U >> 1), i);     for (i = 1; i <= n; ++i)       for (j = 1; j <= m; ++j) C[i + j - 1].v = min(C[i + j - 1].v, P[i][j]);     sort(C + 1, C + n + m, cmp);     for (e = ((n + m) >> 1) + 1, t = 1; t < n + m; ++t) {       ar[C[t].fr] = 1;       memset(f, 0, sizeof(f));       for (f[0][0] = i = 1; i < n + m; ++i) {         if (ar[i]) {           k = (ar[i] == 1 ? -1 : 1);           for (j = 0; j <= e; ++j)             if (j + k > -1) pluss(f[i][j], f[i - 1][j + k]);         } else           for (j = 0; j <= e; ++j) {             if (j > 0) pluss(f[i][j], f[i - 1][j - 1]);             pluss(f[i][j], f[i - 1][j + 1]);           }       }       if (f[n + m - 1][0] < K) {         ar[C[t].fr] = 2;         K -= f[n + m - 1][0];       }     }     for (i = 1; i <= n; ++i) {       for (j = 1; j <= m; ++j) {         if (ar[i + j - 1] == 1)           printf( ( );         else           printf( ) );       }       printf(  n );     }     return 0;   }   