修改了几处题目答案错误及题面描述
This commit is contained in:
parent
b194f192f0
commit
ccd566672a
|
|
@ -1,6 +1,6 @@
|
|||
import os,re,json
|
||||
"""这里编辑题号(列表)后将在vscode中打开窗口, 编辑后保存关闭"""
|
||||
problems = "31338"
|
||||
problems = "014805,014806,014807,014808,014809,014810,014811,014812,014813,014814,014815,014816,014817,014818,014819,014820,014821,014822,014823,014824,014825,030608,030632,030636,030679,030715,030757,030836,030856,030895,030927,030955,030977,031022,031040,031115,031136,031149"
|
||||
editor = "王伟叶"
|
||||
|
||||
def generate_number_set(string,dict):
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
import os,re,json
|
||||
"""这里编辑题号(列表)后将在vscode中打开窗口, 编辑后保存关闭, 随后运行第二个代码块"""
|
||||
problems = "31395"
|
||||
problems = "40466,40473,40482"
|
||||
|
||||
def generate_number_set(string,dict):
|
||||
string = re.sub(r"[\n\s]","",string)
|
||||
|
|
|
|||
|
|
@ -2,7 +2,7 @@ import os,re,json
|
|||
|
||||
"""---设置关键字, 同一field下不同选项为or关系, 同一字典中不同字段间为and关系, 不同字典间为or关系, _not表示列表中的关键字都不含, 同一字典中的数字用来供应同一字段不同的条件之间的and---"""
|
||||
keywords_dict_table = [
|
||||
{"origin":["高一"],"origin2":["08"],"origin3":["周末卷"]}
|
||||
{"origin":["崇明"],"origin2":["二模"]}
|
||||
]
|
||||
"""---关键字设置完毕---"""
|
||||
# 示例： keywords_dict_table = [
|
||||
|
|
|
|||
|
|
@ -1 +1,8 @@
|
|||
040527,040528,040529,040530,040531,040532,040533,040534,040535,040536,040537,040538,040539,040540,040541,040542,040543,040544,040545,040546,040547,040548,040549,040550,040551
|
||||
014805,014806,014807,014808,014809,014810,014811,014812,014813,014814,014815,014816,014817,014818,014819,014820,014821,014822,014823,014824,014825,030608,030632,030636,030679,030715,030757,030836,030856,030895,030927,030955,030977,031022,031040,031115,031136,031149
|
||||
|
||||
|
||||
未使用题号:
|
||||
030608,030632,030636,030679,030715,030757,030836,030856,030895,030927,030955,030977,031022,031040,031115,031136,031149
|
||||
|
||||
已使用题号:
|
||||
014805,014806,014807,014808,014809,014810,014811,014812,014813,014814,014815,014816,014817,014818,014819,014820,014821,014822,014823,014824,014825
|
||||
|
|
@ -10,7 +10,7 @@ paper_type = 1 # 随后设置一下后续的讲义标题
|
|||
"""---设置题块编号---"""
|
||||
|
||||
problems = [
|
||||
"000778,001253,001325,003747,013721,031392,010938,011148,004157,030327,030060,010197,001339,002918,004009","001262,004435,030398,030051,012859,031321,012543,001352,005650,005123,030337,007939,002968,012902,030356"
|
||||
"332,401,654,2605,2664,3574,3640,31196,31320,4584,7361,7423,30227,30275,30540","340,412,2586,3585,4575,11993,7630,14091,31158,7502,10868,30495,30520"
|
||||
|
||||
]
|
||||
|
||||
|
|
@ -20,12 +20,12 @@ problems = [
|
|||
if paper_type == 1:
|
||||
enumi_mode = 0 #设置模式(1为整卷统一编号, 0为每一部分从1开始编号)
|
||||
template_file = "模板文件/复习讲义模板.txt" #设置模板文件名
|
||||
exec_list = [("标题数字待处理","01"),("标题文字待处理","易错题-函数1")] #设置讲义标题
|
||||
exec_list = [("标题数字待处理","05"),("标题文字待处理","易错题-概率与统计")] #设置讲义标题
|
||||
destination_file = "临时文件/"+exec_list[0][1]+"_"+exec_list[1][1] # 设置输出文件名
|
||||
elif paper_type == 2:
|
||||
enumi_mode = 1 #设置模式(1为整卷统一编号, 0为每一部分从1开始编号)
|
||||
template_file = "模板文件/测验周末卷模板.txt" #设置模板文件名
|
||||
exec_list = [("标题替换","2023届杨浦区二模")] #设置讲义标题
|
||||
exec_list = [("标题替换","高三下测验卷07")] #设置讲义标题
|
||||
destination_file = "临时文件/"+exec_list[0][1] # 设置输出文件名
|
||||
elif paper_type == 3:
|
||||
enumi_mode = 0 #设置模式(1为整卷统一编号, 0为每一部分从1开始编号)
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
file_dir = r"C:\Users\weiye\Documents\wwy sync\23届\下学期测验卷"
|
||||
file_dir = r"C:\Users\weiye\Documents\wwy sync\23届\下学期周末卷"
|
||||
filelist = [] #列表为空默认处理所有讲义
|
||||
output_gloss_filename = "下学期测验卷参考答案"
|
||||
output_gloss_filename= "临时"
|
||||
|
||||
import os,re,json
|
||||
|
||||
|
|
|
|||
|
|
@ -5,15 +5,15 @@ import os,re,time,json,sys
|
|||
"""
|
||||
|
||||
"""---设置题目列表---"""
|
||||
#留空为编译全题库, a为读取临时文件中的题号筛选.txt文件生成题库
|
||||
#留空为编译全题库, a为读取文本文件中的题号筛选.txt文件生成题库
|
||||
problems = r"""
|
||||
|
||||
a
|
||||
"""
|
||||
"""---设置题目列表结束---"""
|
||||
|
||||
"""---设置文件名---"""
|
||||
#目录和文件的分隔务必用/
|
||||
filename = "临时文件/题库"
|
||||
filename = "临时文件/崇明"
|
||||
"""---设置文件名结束---"""
|
||||
|
||||
"""---设置是否需要解答题的空格---"""
|
||||
|
|
|
|||
|
|
@ -458726,7 +458726,7 @@
|
|||
"objs": [],
|
||||
"tags": [],
|
||||
"genre": "填空题",
|
||||
"ans": "$\\dfrac{2 \\pi}{3}$",
|
||||
"ans": "$\\dfrac{4 \\pi}{3}$",
|
||||
"solution": "",
|
||||
"duration": -1,
|
||||
"usages": [],
|
||||
|
|
@ -458861,11 +458861,11 @@
|
|||
},
|
||||
"040473": {
|
||||
"id": "040473",
|
||||
"content": "已知函数$y=x^2+p x+q$有两个零点$1$、$2$, 数列$\\{x_n\\}$满足$x_{n+1}=x_n-\\dfrac{f(x_n)}{f'(x_n)}$, 若$a_n=\\ln \\dfrac{x_n-2}{x_n-1}$, 且$a_1=-2$, 则数列$\\{a_n\\}$的前$2023$项的和为\\blank{50}.",
|
||||
"content": "已知函数$f(x)=x^2+p x+q$有两个零点$1$、$2$, 数列$\\{x_n\\}$满足$x_{n+1}=x_n-\\dfrac{f(x_n)}{f'(x_n)}$, 若$a_n=\\ln \\dfrac{x_n-2}{x_n-1}$, 且$a_1=-2$, 则数列$\\{a_n\\}$的前$2023$项的和为\\blank{50}.",
|
||||
"objs": [],
|
||||
"tags": [],
|
||||
"genre": "填空题",
|
||||
"ans": "$1-2^{2023}$",
|
||||
"ans": "$2-2^{2024}$",
|
||||
"solution": "",
|
||||
"duration": -1,
|
||||
"usages": [],
|
||||
|
|
@ -459034,7 +459034,7 @@
|
|||
},
|
||||
"040482": {
|
||||
"id": "040482",
|
||||
"content": "如图, 一智能扫地机器人在$A$处发现位于它正西方向的$B$处和北偏东$30^{\\circ}$方向上的$C$处分别有需要清扫的垃圾, 红外线感应测量发现机器人到$B$的距离比到$C$的距离少$0.4 m$, 于是选择沿$A \\to B \\to C$路线清扫. 已知智能扫地机器人的直线行走速度为$0.2 \\text{m} / \\text{s}$, 忽略机器人吸入垃圾及在$B$处旋转所用时间, $10$秒钟完成了清扫任务.\n\\begin{center}\n\\begin{tikzpicture}[>=latex,scale = 2]\n\\draw (0,0) node [right] {$A$} coordinate (A);\n\\draw (-0.6,0) node [left] {$B$} coordinate (B);\n\\draw (60:1) node [right] {$C$} coordinate (C);\n\\draw (A)--(B)--(C)--cycle;\n\\draw (-0.6,0.6) coordinate (T);\n\\draw [->] (T) --++ (0.3,0) node [right] {东};\n\\draw [->] (T) --++ (0,0.3) node [above] {北};\n\\end{tikzpicture}\n\\end{center}\n(1) $B$、$C$两处垃圾的距离是多少?\\\\\n(2) 智能扫地机器人此次清扫行走路线的夹角$\\angle ABC$是多少?",
|
||||
"content": "如图, 一智能扫地机器人在$A$处发现位于它正西方向的$B$处和北偏东$30^{\\circ}$方向上的$C$处分别有需要清扫的垃圾, 红外线感应测量发现机器人到$B$的距离比到$C$的距离少$0.4 \\text{m}$, 于是选择沿$A \\to B \\to C$路线清扫. 已知智能扫地机器人的直线行走速度为$0.2 \\text{m} / \\text{s}$, 忽略机器人吸入垃圾及在$B$处旋转所用时间, $10$秒钟完成了清扫任务.\n\\begin{center}\n\\begin{tikzpicture}[>=latex,scale = 2]\n\\draw (0,0) node [right] {$A$} coordinate (A);\n\\draw (-0.6,0) node [left] {$B$} coordinate (B);\n\\draw (60:1) node [right] {$C$} coordinate (C);\n\\draw (A)--(B)--(C)--cycle;\n\\draw (-0.6,0.6) coordinate (T);\n\\draw [->] (T) --++ (0.3,0) node [right] {东};\n\\draw [->] (T) --++ (0,0.3) node [above] {北};\n\\end{tikzpicture}\n\\end{center}\n(1) $B$、$C$两处垃圾的距离是多少?\\\\\n(2) 智能扫地机器人此次清扫行走路线的夹角$\\angle ABC$是多少?",
|
||||
"objs": [],
|
||||
"tags": [],
|
||||
"genre": "解答题",
|
||||
|
|
|
|||
Reference in New Issue