1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T5ed,#include using namespace std; typedef long long ll; const ll MOD = 998244353; int main(){ ios::sync_with_stdio(false); cin.tie(0); int N, K; cin >> N >> K; vector> grid(N, vector(N)); for(int i = 0; i < N; i++) { for(int j = 0; j < N; j++) { cin >> grid[i][j]; } } vector>> table(N, vector>(N, vector(K, 0))); int initial_mod = grid[0][0] % K; if(initial_mod < 0) initial_mod += K; table[0][0][initial_mod] = 1; for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ if(i == 0 && j == 0) continue; if(grid[i][j] == -1) continue; int value = grid[i][j]; if(i > 0){ for(int k = 0; k < K; k++){ if(table[i-1][j][k] > 0){ int new_val = (1LL * k * value) % K; table[i][j][new_val] = (table[i][j][new_val] + table[i-1][j][k]) % MOD; } } } if(j > 0){ for(int k = 0; k < K; k++){ if(table[i][j-1][k] > 0){ int new_val = (1LL * k * value) % K; table[i][j][new_val] = (table[i][j][new_val] + table[i][j-1][k]) % MOD; } } }

코드 #842