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:T794,#include "testlib.h" #include #include #include using namespace std; // compute number of whole 1x1 squares fully inside circle of radius R centered at origin long long countSquares(int R) { long long cnt = 0; int lim = R; // bottom-left corner can be from -R to R-1 long long R2 = 1LL * R * R; for (int x = -lim; x < lim; x++) { for (int y = -lim; y < lim; y++) { // check all four corners long long d1 = 1LL*(x)*(x) + 1LL*(y)*(y); long long d2 = 1LL*(x+1)*(x+1) + 1LL*(y)*(y); long long d3 = 1LL*(x)*(x) + 1LL*(y+1)*(y+1); long long d4 = 1LL*(x+1)*(x+1) + 1LL*(y+1)*(y+1); if (d1 <= R2 && d2 <= R2 && d3 <= R2 && d4 <= R2) cnt++; } } return cnt; } int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose a scenario for s // 0: minimal, 1: small random, 2: threshold around integer R, 3: medium, 4: large, 5: random mid-large int scenario = rnd.next(0,5); long long s = 1; if (scenario == 0) { // minimal edge s = 1; } else if (scenario == 1) { // small random s = rnd.next(1, 20); } else if (scenario == 2) { // near perfect square-count thresholds for integer radius int R = rnd.next(2, 20); long long base = countSquares(R); vector del = { -1, 0, 1 }; long long d

코드 #6077