本文档非 ACGO 官方编写,如有侵权,请加入Q群联系删除!
curl --location --request GET 'https://www.acgo.cn/_next/data/Dntxx5Tb-3Sm_N0dyj_tg/problemset.json'
{ "pageProps": { "tabs": [ { "label": "算法", "key": 272, "href": "/problemset", "preventDefault": true }, { "label": "语法", "key": 273, "href": "/problemset?tab=273", "preventDefault": true } ], "listData": { "list": [ { "questionId": 1, "pmsQuestionId": 7315, "pmsQuestionVersionId": 1020788, "pmsQuestionCode": "CP002436", "questionCode": "A1", "stem": "这是一道入门题,计算a+b的和", "subjectType": 3, "questionType": 7, "knowledge": [ { "knowledgeId": 287, "knowledgeTitle": "模拟" } ], "knowledgeIds": "287", "difficultyTagTitle": "入门", "difficultyId": 10000001, "source": "官方", "sourceId": 117, "yearName": null, "yearId": 0, "areaId": 0, "areaName": null, "creatorName": "ACGO官方", "creatorId": 15547, "updateAt": null, "createdAt": "2024-01-18 13:40:55", "title": "A+B problem", "fromId": 1, "passingRate": "25.68%", "answerStatus": 1, "applicationType": 0, "teamId": 0, "teamName": null, "externalOjPlatformId": null, "externalQuestionId": null }, { "questionId": 2, "pmsQuestionId": 7316, "pmsQuestionVersionId": 1045515, "pmsQuestionCode": "CP002437", "questionCode": "A2", "stem": "西虹市要新建一个广场,为了美观,要求完全是正方形。目前正在规划当中,正方形的大小和位置都在热烈的讨论之中。假设将可用于造广场的区域看成一个矩形,由1*1的单位正方形构成。如下图:这是一个$4 * 6$的矩形区域。\n\n\n\n\n\n广场要求必须在这个矩形范围内,广场边线不能跨过任意一个单位正方形内部,只能与正方形边线重合,且广场必须为正方形。那么上图中,以下4种正方形均为可行方案:\n\n\n\n\n市民们提出了很多建造广场的方案。现在领导想要知道,到底有多少种不同的方案可以选择?请你设计一个程序,来计算以下建造广场的最多可行方案数。", "subjectType": 3, "questionType": 7, "knowledge": [ { "knowledgeId": 332, "knowledgeTitle": "中学数学" } ], "knowledgeIds": "332", "difficultyTagTitle": "普及/提高-", "difficultyId": 10000003, "source": "官方", "sourceId": 117, "yearName": null, "yearId": 0, "areaId": 0, "areaName": null, "creatorName": "ACGO官方", "creatorId": 15547, "updateAt": null, "createdAt": "2024-01-18 13:41:52", "title": "数方格", "fromId": 1, "passingRate": "59.58%", "answerStatus": 1, "applicationType": 0, "teamId": 0, "teamName": null, "externalOjPlatformId": null, "externalQuestionId": null }, { "questionId": 3, "pmsQuestionId": 7526, "pmsQuestionVersionId": 1045568, "pmsQuestionCode": "CP002510", "questionCode": "A3", "stem": "给定长度为 $n$ 的非严格递增正整数数列 $1 \\le a_1 \\le a_2 \\le \\cdots \\le a_n$。每次可以进行的操作是:任意选择一个正整数 $1 < i < n$,将 $a_i$ 变为 $a_{i - 1} + a_{i + 1} - a_i$。求在若干次操作之后,该数列的方差最小值是多少。请输出最小值乘以 $n^2$ 的结果。\n\n其中方差的定义为:数列中每个数与平均值的差的平方的平均值。更形式化地说,方差的定义为 $D = \\frac{1}{n} \\sum_{i = 1}^{n} {(a_i - \\bar a)}^2$,其中 $\\bar a = \\frac{1}{n} \\sum_{i = 1}^{n} a_i$。", "subjectType": 3, "questionType": 7, "knowledge": [ { "knowledgeId": 330, "knowledgeTitle": "数论" } ], "knowledgeIds": "330", "difficultyTagTitle": "普及-", "difficultyId": 10000002, "source": "NOIP提高组", "sourceId": 119, "yearName": "2021", "yearId": 115,
扫码加入 ACGO-API-Collect 交流群
在这里,获得本项目使用上的帮助,快速解决问题
扫码加入 ACGO 官方QQ交流群
探讨ACGO相关学习技术问题,第一时间获得解答