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:T61f,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of missions and agents int N = rnd.next(1, 20); // Choose pattern type for diversity int type = rnd.next(0, 4); vector> P(N, vector(N)); if (type == 0) { // Fully random probabilities for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) P[i][j] = rnd.next(0, 100); } else if (type == 1) { // Diagonal has higher success rates for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) P[i][j] = (i == j ? rnd.next(50, 100) : rnd.next(0, 50)); } else if (type == 2) { // One row is dominant int r = rnd.next(0, N - 1); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) P[i][j] = (i == r ? rnd.next(50, 100) : rnd.next(0, 50)); } else if (type == 3) { // One column is dominant int c = rnd.next(0, N - 1); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) P[i][j] = (j == c ? rnd.next(50, 100) : rnd.next(0, 50)); } else { // Sparse matrix with many zeros double density = rnd.next(1, 100) / 100.0; for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) P[i][j] = (rnd.next() < density ? rnd.next(0, 100) : 0)

코드 #5948