19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","643","static/chunks/app/codes/%5Bid%5D/page-181bbdf63cf242d5.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","643","static/chunks/app/codes/%5Bid%5D/page-181bbdf63cf242d5.js"],"CodeViewer"] 1b:T4b7,#include using namespace std; #define int long long int K, p10[5000]; struct num { string s; int mod, len; void calc() { len = s.size(); mod = 0; int p = 1; for(int i=len-1; i>=0; i--) { mod += p*(s[i] - '0'); p *= 10; p %= K; mod %= K; } } }; int tomod(int t) { t %= K; if(t < 0) return t + K; return t; } num arr[15]; int dp[1<<15][100], n; int f(int bm, int t) { if(!bm) { return t ? 0 : 1; } int &ret = dp[bm][t]; if(ret != -1) return ret; ret = 0; int tlen = 0; for(int i=0; i> n; for(int i=0; i> arr[i].s; cin >> K; p10[0] = 1; for(int i=1; i<5000; i++) p10[i] = (p10[i-1] * 10) % K; memset(dp, -1, sizeof dp); for(int i=0; i

코드 #1113