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:T77e,#include using namespace std; #define int long long #define _USE_MATH_DEFINES #define sz(v) ((int)(v).size()) #define all(v) (v).begin(),(v).end() #define rep(i, n) for(int i=0; i vi; typedef complex base; void fft(vector &a, bool invert) { int n = sz(a); for (int i=1,j=0;i> 1; for (;j>=bit;bit>>=1) j -= bit; j += bit; if(i < j) swap(a[i], a[j]); } for(int len=2; len<=n; len<<=1) { double ang = 2*M_PI/len*(invert ? -1 : 1); base wlen(cos(ang), sin(ang)); for(int i=0; i fa(all(a)), fb(all(b)); int n=1; while(n < max(sz(a), sz(b))) n <<=1; fa.resize(n); fb.resize(n); fft(fa, false); fft(fb, false); for(int i=0; i 0 ? 0.5 : -0.5)); } } int32_t main() { cin.tie(0)->sync_with_stdio(0); int N, L, M, W; cin >> N >> L >> M >> W;

코드 #4097