15:I[42907,["401","static/chunks/363642f4-812e50cc3e323d2c.js","213","static/chunks/213-b2337299901a9046.js","152","static/chunks/152-6ad5ee8e457afbb4.js","393","static/chunks/393-460011df65777e34.js","659","static/chunks/app/codes/%5Bid%5D/page-f39212c89e2a3314.js"],"CodeViewer"] 16:T617,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Generate small N and H for easy verification int N = rnd.next(2, 5); int H = rnd.next(1, 5); // Generate all possible positions for horizontal lines vector> positions; for (int a = 1; a <= H; ++a) { for (int b = 1; b <= N - 1; ++b) { positions.emplace_back(a, b); } } // Shuffle positions to randomize selection shuffle(positions.begin(), positions.end()); // Filter positions to avoid conflicts set> used; vector> valid_positions; for (auto& pos : positions) { int a = pos.first; int b = pos.second; // Ensure no two horizontal lines are adjacent or overlap if (used.count({a, b})) continue; if (used.count({a, b - 1})) continue; if (used.count({a, b + 1})) continue; used.insert({a, b}); valid_positions.push_back(pos); } // The maximum number of horizontal lines we can place without conflicts int maxM = valid_positions.size(); // Randomly choose M between 0 and maxM int M = rnd.next(0, maxM); println(N, M, H); // Shuffle valid_positions again to randomize the output shuffle(valid_positions.begin(), valid_positions.end()); // Output M horizontal lines for (int i = 0; i < M; ++i) { println(valid_positions[i].first, valid_positions[i].second); } return 0; }5:["$","div",null,{"className":"container mx-auto px-4","children":[["$","h1",null,{"className":"mb-4 text-2xl font-bold","children":["코드 #",414]}],["$","div",null,{"className":"mb-2","children":

코드 #414