&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector> A){ init_(A); }\\n void init(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector> &Y) { concat_col_(Y); }\\n void concat_col(vector &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector> &Y) { concat_row_(Y); }\\n void concat_row(vector &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix;\\n\\ntemplate struct GaussJordan{\\n private:\\n int rank;\\n vector solution;\\n\\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector solve_simultaneous_equation_(vector> &A , vector &b){\\n Matrix X(A), Y(b);\\n return solve_simultaneous_equation_(X, Y);\\n }\\n vector solve_simultaneous_equation_(Matrix &A , vector &b){\\n Matrix Y(b);\\n return solve_simultaneous_equation_(A, Y);\\n }\\n vector solve_simultaneous_equation_(vector> &A , Matrix &b){\\n Matrix X(A);\\n return solve_simultaneous_equation_(X, b);\\n }\\n vector solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n A.concat_col(b);\\n return solve_simultaneous_equation_(A);\\n }\\n vector solve_simultaneous_equation_(vector> &A){\\n return solve_simultaneous_equation_(to_matrix(A));\\n }\\n vector solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(Matrix &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A) { return solve_simultaneous_equation_(A); }\\n vector solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector> S;\\nvector> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector(m));\\n A.resize(n, vector(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector> M(n*m,vector(n*m,0));\\n vector res(n*m);\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) res[i*m+j] = 1;\\n }\\n GaussJordan gj;\\n auto ans = gj.solve_simultaneous_equation(M,res);\\n if(ans.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3852,\n \"score_of_the_acc\": -0.0548,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1308_7339747\",\n \"code_snippet\": \"#include \\nusing namespace std ;\\n#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);\\n#pragma GCC optimize(\\\"Ofast,no-stack-protector,unroll-loops,fast-math\\\")\\ntypedef long long ll ;\\ntypedef long double ld ;\\ntypedef pair P ;\\ntypedef tuple TP ;\\n#define chmin(a,b) a = min(a,b)\\n#define chmax(a,b) a = max(a,b)\\n#define bit_count(x) __builtin_popcountll(x)\\n#define gcd(a,b) __gcd(a,b)\\n#define lcm(a,b) a / gcd(a,b) * b\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\\n#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)\\n#define pt(a) cout << a << endl\\n#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << \\\" \\\" ; cout << endl ;\\n#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;\\n#define DEBUG_REP(V) cout << \\\"{ \\\" ; repi(itr,V) cout << *itr << \\\", \\\" ; cout << \\\"}\\\" << endl ;\\n#define debug(a) cout << #a << \\\" \\\" << a << endl\\n#define all(a) a.begin(), a.end()\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate struct BitMatrix{\\n\\n private:\\n int row, col;\\n vector> mat;\\n\\n void init_(vector> A){\\n row = A.size();\\n col = A[0].size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n for(int j = 0; j < col; j++){\\n if(A[i][j] != 0) mat[i][j] = 1;\\n else mat[i][j] = 0;\\n }\\n }\\n }\\n \\n void init_(vector A, bool row_matrix = false){\\n if(row_matrix) {\\n col = (int)A.size();\\n row = 1;\\n mat.resize(1);\\n for(int i = 0; i < col; i++){\\n if(A[i] != 0) mat[0][i] = 1;\\n else mat[0][i] = 0;\\n }\\n }\\n else {\\n col = 1;\\n row = (int)A.size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n if(A[i] != 0) mat[i][0] = 1;\\n else mat[i][0] = 0;\\n }\\n }\\n }\\n\\n void transpose_() {\\n vector> res(col);\\n rep(i,row) rep(j,col) res[j][i] = mat[i][j];\\n mat = res;\\n swap(row,col);\\n }\\n \\n void flip_() {\\n rep(i,row) rep(j,col) mat[i][j].flip();\\n }\\n\\n void concat_col_(vector &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(vector> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(BitMatrix &Y) {\\n assert((int)Y.row == row);\\n rep(i,row) {\\n rep(j,Y.col) mat[i][j+col] = (Y.mat[i][j]);\\n }\\n col += Y.col;\\n }\\n\\n void concat_row_(vector &Y) {\\n BitMatrix X(Y,true);\\n concat_row_(X);\\n }\\n void concat_row_(vector> &Y) {\\n BitMatrix X(Y);\\n concat_row_(X);\\n }\\n void concat_row_(BitMatrix &Y) {\\n assert((int)Y.col == col);\\n row += Y.row;\\n rep(i,Y.row) mat.push_back(Y.mat[i]);\\n }\\n\\n void print_() {\\n rep(i,row){\\n rep(j,col) cout << mat[i][j]; cout << endl;\\n }\\n }\\n\\n public:\\n\\n inline BitMatrix &operator&=(const BitMatrix Y) {\\n rep(i,row) mat[i] &= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix &operator|=(const BitMatrix Y) {\\n rep(i,row) mat[i] |= Y.mat[i];\\n return *this ;\\n }\\n \\n inline BitMatrix &operator^=(const BitMatrix Y) {\\n rep(i,row) mat[i] ^= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix operator&(const BitMatrix Y) const { return BitMatrix(*this) &= Y; }\\n\\n inline BitMatrix operator|(const BitMatrix Y) const { return BitMatrix(*this) |= Y; }\\n\\n inline BitMatrix operator^(const BitMatrix Y) const { return BitMatrix(*this) += Y; }\\n\\n inline bool operator==(const BitMatrix Y) const { return mat == Y.mat; }\\n\\n inline bool operator!=(const BitMatrix Y) const { return mat != Y.mat; }\\n\\n inline bitset&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector> A){ init_(A); }\\n void init(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector> &Y) { concat_col_(Y); }\\n void concat_col(vector &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector> &Y) { concat_row_(Y); }\\n void concat_row(vector &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix;\\n\\ntemplate struct GaussJordan{\\n private:\\n int rank;\\n vector solution;\\n \\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector solve_simultaneous_equation_(vector> &A , vector &b){\\n Matrix X(A), Y(b);\\n return solve_simultaneous_equation_(X,Y);\\n }\\n vector solve_simultaneous_equation_(Matrix &A , vector &b){\\n return solve_simultaneous_equation_(A, Matrix(b));\\n }\\n vector solve_simultaneous_equation_(vector> &A , Matrix &b){\\n return solve_simultaneous_equation_(Matrix(A), b);\\n }\\n vector solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n A.concat_col(b);\\n return solve_simultaneous_equation_(A);\\n }\\n vector solve_simultaneous_equation_(vector> &A){\\n Matrix M(A);\\n return solve_simultaneous_equation_(M);\\n }\\n vector solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(Matrix &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A) { return solve_simultaneous_equation_(A); }\\n vector solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector> S;\\nvector> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector(m));\\n A.resize(n, vector(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector> M(n*m,vector(n*m,0));\\n vector res(n*m);\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) res[i*m+j] = 1;\\n }\\n GaussJordan gj;\\n auto ans = gj.solve_simultaneous_equation(M,res);\\n if(ans.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.0408,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1308_7339729\",\n \"code_snippet\": \"#include \\nusing namespace std ;\\n#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);\\n#pragma GCC optimize(\\\"Ofast,no-stack-protector,unroll-loops,fast-math\\\")\\ntypedef long long ll ;\\ntypedef long double ld ;\\ntypedef pair P ;\\ntypedef tuple TP ;\\n#define chmin(a,b) a = min(a,b)\\n#define chmax(a,b) a = max(a,b)\\n#define bit_count(x) __builtin_popcountll(x)\\n#define gcd(a,b) __gcd(a,b)\\n#define lcm(a,b) a / gcd(a,b) * b\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\\n#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)\\n#define pt(a) cout << a << endl\\n#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << \\\" \\\" ; cout << endl ;\\n#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;\\n#define DEBUG_REP(V) cout << \\\"{ \\\" ; repi(itr,V) cout << *itr << \\\", \\\" ; cout << \\\"}\\\" << endl ;\\n#define debug(a) cout << #a << \\\" \\\" << a << endl\\n#define all(a) a.begin(), a.end()\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate struct BitMatrix{\\n\\n private:\\n int row, col;\\n vector> mat;\\n\\n void init_(vector> A){\\n row = A.size();\\n col = A[0].size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n for(int j = 0; j < col; j++){\\n if(A[i][j] != 0) mat[i][j] = 1;\\n else mat[i][j] = 0;\\n }\\n }\\n }\\n \\n void init_(vector A, bool row_matrix = false){\\n if(row_matrix) {\\n col = (int)A.size();\\n row = 1;\\n mat.resize(1);\\n for(int i = 0; i < col; i++){\\n if(A[i] != 0) mat[0][i] = 1;\\n else mat[0][i] = 0;\\n }\\n }\\n else {\\n col = 1;\\n row = (int)A.size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n if(A[i] != 0) mat[i][0] = 1;\\n else mat[i][0] = 0;\\n }\\n }\\n }\\n\\n void transpose_() {\\n vector> res(col);\\n rep(i,row) rep(j,col) res[j][i] = mat[i][j];\\n mat = res;\\n swap(row,col);\\n }\\n \\n void flip_() {\\n rep(i,row) rep(j,col) mat[i][j].flip();\\n }\\n\\n void concat_col_(vector &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(vector> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(BitMatrix &Y) {\\n assert((int)Y.row == row);\\n rep(i,row) {\\n rep(j,Y.col) mat[i][j+col] = (Y.mat[i][j]);\\n }\\n col += Y.col;\\n }\\n\\n void concat_row_(vector &Y) {\\n BitMatrix X(Y,true);\\n concat_row_(X);\\n }\\n void concat_row_(vector> &Y) {\\n BitMatrix X(Y);\\n concat_row_(X);\\n }\\n void concat_row_(BitMatrix &Y) {\\n assert((int)Y.col == col);\\n row += Y.row;\\n rep(i,Y.row) mat.push_back(Y.mat[i]);\\n }\\n\\n void print_() {\\n rep(i,row){\\n rep(j,col) cout << mat[i][j]; cout << endl;\\n }\\n }\\n\\n public:\\n\\n inline BitMatrix &operator&=(const BitMatrix Y) {\\n rep(i,row) mat[i] &= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix &operator|=(const BitMatrix Y) {\\n rep(i,row) mat[i] |= Y.mat[i];\\n return *this ;\\n }\\n \\n inline BitMatrix &operator^=(const BitMatrix Y) {\\n rep(i,row) mat[i] ^= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix operator&(const BitMatrix Y) const { return BitMatrix(*this) &= Y; }\\n\\n inline BitMatrix operator|(const BitMatrix Y) const { return BitMatrix(*this) |= Y; }\\n\\n inline BitMatrix operator^(const BitMatrix Y) const { return BitMatrix(*this) += Y; }\\n\\n inline bool operator==(const BitMatrix Y) const { return mat == Y.mat; }\\n\\n inline bool operator!=(const BitMatrix Y) const { return mat != Y.mat; }\\n\\n inline bitset&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector> A){ init_(A); }\\n void init(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector> &Y) { concat_col_(Y); }\\n void concat_col(vector &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector> &Y) { concat_row_(Y); }\\n void concat_row(vector &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix;\\n\\ntemplate struct GaussJordan{\\n private:\\n int rank;\\n vector solution;\\n \\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector solve_simultaneous_equation_(vector> &A , vector &b){\\n return solve_simultaneous_equation_(Matrix(A), Matrix(b));\\n }\\n vector solve_simultaneous_equation_(Matrix &A , vector &b){\\n return solve_simultaneous_equation_(A, Matrix(b));\\n }\\n vector solve_simultaneous_equation_(vector> &A , Matrix &b){\\n return solve_simultaneous_equation_(Matrix(A), b);\\n }\\n vector solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n return solve_simultaneous_equation_(A.concat_col(b));\\n }\\n vector solve_simultaneous_equation_(vector> &A){\\n Matrix M(A);\\n return solve_simultaneous_equation_(M);\\n }\\n vector solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(Matrix &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A) { return solve_simultaneous_equation_(A); }\\n vector solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector> S;\\nvector> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector(m));\\n A.resize(n, vector(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector> M(n*m,vector(n*m+1,0));\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) M[i*m+j][n*m] = 1;\\n }\\n GaussJordan gj;\\n auto res = gj.solve_simultaneous_equation(M);\\n if(res.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3828,\n \"score_of_the_acc\": -0.0516,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1308_7339652\",\n \"code_snippet\": \"#include \\nusing namespace std ;\\n#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);\\n#pragma GCC optimize(\\\"Ofast,no-stack-protector,unroll-loops,fast-math\\\")\\ntypedef long long ll ;\\ntypedef long double ld ;\\ntypedef pair P ;\\ntypedef tuple TP ;\\n#define chmin(a,b) a = min(a,b)\\n#define chmax(a,b) a = max(a,b)\\n#define bit_count(x) __builtin_popcountll(x)\\n#define gcd(a,b) __gcd(a,b)\\n#define lcm(a,b) a / gcd(a,b) * b\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\\n#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)\\n#define pt(a) cout << a << endl\\n#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << \\\" \\\" ; cout << endl ;\\n#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;\\n#define DEBUG_REP(V) cout << \\\"{ \\\" ; repi(itr,V) cout << *itr << \\\", \\\" ; cout << \\\"}\\\" << endl ;\\n#define debug(a) cout << #a << \\\" \\\" << a << endl\\n#define all(a) a.begin(), a.end()\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate struct BitMatrix{\\n\\n private:\\n int row, col;\\n vector> mat;\\n\\n void init_(vector> A){\\n row = A.size();\\n col = A[0].size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n for(int j = 0; j < col; j++){\\n if(A[i][j] != 0) mat[i][j] = 1;\\n else mat[i][j] = 0;\\n }\\n }\\n }\\n \\n void init_(vector A, bool row_matrix = false){\\n if(row_matrix) {\\n col = (int)A.size();\\n row = 1;\\n mat.resize(1);\\n for(int i = 0; i < col; i++){\\n if(A[i] != 0) mat[0][i] = 1;\\n else mat[0][i] = 0;\\n }\\n }\\n else {\\n col = 1;\\n row = (int)A.size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n if(A[i] != 0) mat[i][0] = 1;\\n else mat[i][0] = 0;\\n }\\n }\\n }\\n\\n void transpose_() {\\n vector> res(col);\\n rep(i,row) rep(j,col) res[j][i] = mat[i][j];\\n mat = res;\\n swap(row,col);\\n }\\n \\n void flip_() {\\n rep(i,row) rep(j,col) mat[i][j].flip();\\n }\\n\\n void concat_col_(vector &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(vector> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(BitMatrix &Y) {\\n assert((int)Y.row == row);\\n rep(i,row) {\\n rep(j,Y.col) mat[i][j+col] = (Y.mat[i][j]);\\n }\\n col += Y.col;\\n }\\n\\n void concat_row_(vector &Y) {\\n BitMatrix X(Y,true);\\n concat_row_(X);\\n }\\n void concat_row_(vector> &Y) {\\n BitMatrix X(Y);\\n concat_row_(X);\\n }\\n void concat_row_(BitMatrix &Y) {\\n assert((int)Y.col == col);\\n row += Y.row;\\n rep(i,Y.row) mat.push_back(Y.mat[i]);\\n }\\n\\n void print_() {\\n rep(i,row){\\n rep(j,col) cout << mat[i][j]; cout << endl;\\n }\\n }\\n\\n public:\\n\\n inline BitMatrix &operator&=(const BitMatrix Y) {\\n rep(i,row) mat[i] &= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix &operator|=(const BitMatrix Y) {\\n rep(i,row) mat[i] |= Y.mat[i];\\n return *this ;\\n }\\n \\n inline BitMatrix &operator^=(const BitMatrix Y) {\\n rep(i,row) mat[i] ^= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix operator&(const BitMatrix Y) const { return BitMatrix(*this) &= Y; }\\n\\n inline BitMatrix operator|(const BitMatrix Y) const { return BitMatrix(*this) |= Y; }\\n\\n inline BitMatrix operator^(const BitMatrix Y) const { return BitMatrix(*this) += Y; }\\n\\n inline bool operator==(const BitMatrix Y) const { return mat == Y.mat; }\\n\\n inline bool operator!=(const BitMatrix Y) const { return mat != Y.mat; }\\n\\n inline bitset&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector> A){ init_(A); }\\n void init(vector A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector> &Y) { concat_col_(Y); }\\n void concat_col(vector &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector> &Y) { concat_row_(Y); }\\n void concat_row(vector &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix;\\n\\ntemplate struct GaussJordan{\\n private:\\n int rank;\\n vector solution;\\n \\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector solve_simultaneous_equation_(vector> &A , vector &b){\\n return solve_simultaneous_equation_(Matrix(A), Matrix(b));\\n }\\n vector solve_simultaneous_equation_(Matrix &A , vector &b){\\n return solve_simultaneous_equation_(A, Matrix(b));\\n }\\n vector solve_simultaneous_equation_(vector> &A , Matrix &b){\\n return solve_simultaneous_equation_(Matrix(A), b);\\n }\\n vector solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n return solve_simultaneous_equation_(A.concat_col(b));\\n }\\n vector solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(Matrix &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , vector &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(vector> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector> S;\\nvector> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector(m));\\n A.resize(n, vector(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector> M(n*m,vector(n*m+1,0));\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) M[i*m+j][n*m] = 1;\\n }\\n GaussJordan gj;\\n auto res = gj.solve_simultaneous_equation(Matrix(M));\\n if(res.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.0223,\n \"final_rank\": 3\n }\n]"}}},{"rowIdx":760,"cells":{"group_id":{"kind":"string","value":"aoj_1310_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nFind the Multiples\nYou are given a sequence\na\n0\na\n1\n...\na\nN\n-1\ndigits and a prime number\nQ\n. For each\ni\n≤\nj\nwith\na\ni\n≠ 0, the subsequence\na\ni\na\ni\n+1\n...\na\nj\ncan be read as a decimal representation of a positive integer. Subsequences with leading zeros are not considered. Your task is to count the number of pairs (\ni\n,\nj\n) such that the corresponding subsequence is a multiple of\nQ\n.\nInput\nThe input consists of at most 50 datasets. Each dataset is represented by a line containing four integers\nN\n,\nS\n,\nW\n, and\nQ\n, separated by spaces, where 1 ≤\nN\n≤ 10\n5\n, 1 ≤\nS\n≤ 10\n9\n, 1 ≤\nW\n≤ 10\n9\n, and\nQ\nis a prime number less than 10\n8\n. The sequence\na\n0\n...\na\nN\n-1\nof length\nN\nis generated by the following code, in which ai is written as\na[i]\n.\nint g = S;\n for(int i=0; i\n#include