solution_code_ko
stringlengths 27
5.97k
| answer_ko
stringlengths 1
11
| answer_en
stringlengths 1
20
| solution_abst_ko
stringlengths 1
256
| solution_code_en
stringlengths 27
5.97k
| solution_abst_en
stringlengths 1
287
| question_en
stringlengths 20
555
| question_ko
stringlengths 11
282
| category
stringclasses 5
values |
|---|---|---|---|---|---|---|---|---|
var_a = 7.5
var_b = 0.75
var_c = var_a / var_b
print(int(var_c))
|
10
|
10
|
15/2 3/4 [OP_DIV]
|
var_a = 7.5
var_b = 0.75
var_c = var_a / var_b
print(int(var_c))
|
15/2 3/4 [OP_DIV]
|
If 3/4 meter (m) of reinforcing bar weighs 15/2 kilograms (kg), how many kilograms (kg) does 1 meter (m) of reinforcing bar weigh?
|
μ² κ·Ό 3/4λ―Έν°(m)μ 무κ²κ° 15/2ν¬λ‘κ·Έλ¨(γ)μΌ λ μ² κ·Ό 1λ―Έν°(m)μ 무κ²λ λͺ ν¬λ‘κ·Έλ¨(γ)μ
λκΉ?
|
Arithmetic calculation
|
var_a = 9
var_b = 3
var_c = var_a ** var_b
var_d = 3
var_e = 3
var_f = var_d ** var_e
var_g = 12
var_h = var_f * var_g
var_i = var_c - var_h
print(int(var_i))
|
405
|
405
|
9 3 [OP_POW] 3 3 [OP_POW] 12 [OP_MUL] [OP_SUB]
|
var_a = 9
var_b = 3
var_c = var_a ** var_b
var_d = 3
var_e = 3
var_f = var_d ** var_e
var_g = 12
var_h = var_f * var_g
var_i = var_c - var_h
print(int(var_i))
|
9 3 [OP_POW] 3 3 [OP_POW] 12 [OP_MUL] [OP_SUB]
|
From a cube with one edge length of 9 centimeters (cm), cut a cube with one edge length of 3 centimeters (cm) as many as the number of edges, and find out how many cubic centimeters (cm3) the volume of the remaining part is.
|
ν λͺ¨μ리μ κΈΈμ΄κ° 9μΌν°λ―Έν°(γ)μΈ μ μ‘면체μμ ν λͺ¨μ리μ κΈΈμ΄κ° 3μΌν°λ―Έν°(γ)μΈ μ μ‘면체λ₯Ό λͺ¨μ리μ κ°μλ§νΌ μλΌλ΄κ³ λ¨μ λΆλΆμ λΆνΌλ λͺ μΈμ κ³±μΌν°λ―Έν°(γ€)μΈμ§ μμ보μλΌ.
|
Geometry
|
var_a = 10
var_b = 3
var_c = var_a * var_b
var_d = 16
var_e = var_c + var_d
print(int(var_e))
|
46
|
46
|
10 3 [OP_MUL] 16 [OP_ADD]
|
var_a = 10
var_b = 3
var_c = var_a * var_b
var_d = 16
var_e = var_c + var_d
print(int(var_e))
|
10 3 [OP_MUL] 16 [OP_ADD]
|
There are 10 go stones in 1 bundle. If there are 3 bundles of black go stones and 16 white go stones, how many go stones are there in all?
|
1λ¬Άμμ κ°μλ 10κ° μ
λλ€. κ²μμ λ°λλμ΄ 3λ¬Άμ μκ³ , ν°μ λ°λλμ΄ 16κ° μλ€λ©΄ λ°λλμ λͺ¨λ λͺ κ° μμ΅λκΉ?
|
Arithmetic calculation
|
var_a = 1
var_b = 200
var_c = 1
list_a = [i for i in range(var_a, var_b + 1, var_c)]
var_d=""
for i in list_a:
i = str(i)
var_d = var_d + i
list_b = []
var_d = int(var_d)
while var_d//10 > 0:
list_b.append(var_d%10)
var_d = var_d//10
list_b.append(var_d%10)
list_b = list_b[::-1]
var_e = 1
var_f = 0
var_e = int(var_e)
for i in list_b:
i = int(i)
if i == var_e:
var_f = var_f + 1
print(int(var_f))
|
140
|
140
|
1 200 1 [OP_LIST_ARANGE] [OP_LIST2NUM] [OP_NUM2LIST] 1 [OP_LIST_FIND_NUM]
|
var_a = 1
var_b = 200
var_c = 1
list_a = [i for i in range(var_a, var_b + 1, var_c)]
var_d=""
for i in list_a:
i = str(i)
var_d = var_d + i
list_b = []
var_d = int(var_d)
while var_d//10 > 0:
list_b.append(var_d%10)
var_d = var_d//10
list_b.append(var_d%10)
list_b = list_b[::-1]
var_e = 1
var_f = 0
var_e = int(var_e)
for i in list_b:
i = int(i)
if i == var_e:
var_f = var_f + 1
print(int(var_f))
|
1 200 1 [OP_LIST_ARANGE] [OP_LIST2NUM] [OP_NUM2LIST] 1 [OP_LIST_FIND_NUM]
|
You are trying to write natural numbers from 1 to 200. How many times should the number 1 be written in all?
|
1λΆν° 200κΉμ§ μμ°μλ₯Ό μ°λ €κ³ ν©λλ€. μ«μ 1μ λͺ¨λ λͺ λ² μ¨μΌ ν©λκΉ?
|
Correspondence
|
var_a = 48
var_b = 12
var_c = var_a - var_b
var_d = 22
var_e = var_c + var_d
print(int(var_e))
|
58
|
58
|
48 12 [OP_SUB] 22 [OP_ADD]
|
var_a = 48
var_b = 12
var_c = var_a - var_b
var_d = 22
var_e = var_c + var_d
print(int(var_e))
|
48 12 [OP_SUB] 22 [OP_ADD]
|
48 is the result of accidentally adding 12 to a number where 22 should have been added. How much do you get if you calculate correctly?
|
48μ μ΄λ€ μμ 22λ₯Ό λν΄μΌ νλλ° μ€μλ‘ 12λ₯Ό λνμ¬ λμ¨ κ²°κ³Όμ
λλ€. λ°λ₯΄κ² κ³μ°νλ©΄ μΌλ§κ° λ©λκΉ?
|
Correspondence
|
var_a = 33.3
var_b = 9
var_c = var_a / var_b
print('{:.2f}'.format(round(var_c+1e-10,2)))
|
3.70
|
3.7
|
33.3 9 [OP_DIV]
|
var_a = 33.3
var_b = 9
var_c = var_a / var_b
print('{:.2f}'.format(round(var_c+1e-10,2)))
|
33.3 9 [OP_DIV]
|
A parallelogram with an area of 33.3 square centimeters (cm2) has a base of 9 centimeters (cm). What is the height of the parallelogram?
|
λμ΄κ° 33.3μ κ³±μΌν°λ―Έν°(γ )μΈ ννμ¬λ³νμ λ°λ³μ΄ 9μΌν°λ―Έν°(γ)μ
λλ€. ννμ¬λ³νμ λμ΄λ μΌλ§μ
λκΉ?
|
Geometry
|
var_a = 8
var_b = 0.3333333333333333
var_c = var_a ** var_b
var_d = 10
var_e = var_c * var_d
print(int(var_e))
|
20
|
20
|
8 1/3 [OP_POW] 10 [OP_MUL]
|
var_a = 8
var_b = 0.3333333333333333
var_c = var_a ** var_b
var_d = 10
var_e = var_c * var_d
print(int(var_e))
|
8 1/3 [OP_POW] 10 [OP_MUL]
|
How many millimeters (mm) is the length of one edge of a dice with a volume of 8 cubic centimeters (cm3)?
|
λΆνΌκ° 8μΈμ κ³±μΌν°λ―Έν°(γ€)μΈ μ£Όμ¬μμ ν λͺ¨μ리μ κΈΈμ΄λ λͺ λ°λ¦¬λ―Έν°(γ)μ
λκΉ?
|
Geometry
|
var_a = '8A19'
ans_dict = dict()
var_a = str(var_a)
list_a = []
variable_candi = set(['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'])
for v in set(var_a):
if v in variable_candi:
ans_dict[v] = 0
candi = list(itertools.product('0123456789', repeat=len(ans_dict)))
for c in candi:
temp = var_a
for i, (k, _) in enumerate(ans_dict.items()):
temp = temp.replace(k, str(c[i]))
if len(var_a) == len(str(int(temp))):
new_elem = int(temp)
list_a.append(new_elem)
var_b = 8500
var_c = 50
var_d = var_b - var_c
list_b = []
for i in list_a:
if i >= var_d:
list_b.append(i)
var_e = 8500
var_f = 50
var_g = var_e + var_f
list_c = []
for i in list_b:
if i < var_g:
list_c.append(i)
var_h = '8A19'
var_i = 'A'
var_h = str(var_h)
var_i = str(var_i)
unk_idx = var_h.index(var_i)
var_j = 0
for elem in list_c:
elem = str(elem)
var_j = int(elem[unk_idx])
print(int(var_j))
|
5
|
5
|
8A19 [OP_GEN_POSSIBLE_LIST] 8500 50 [OP_SUB] [OP_LIST_MORE_EQUAL] 8500 50 [OP_ADD] [OP_LIST_LESS] 8A19 A [OP_LIST_FIND_UNK]
|
var_a = '8A19'
ans_dict = dict()
var_a = str(var_a)
list_a = []
variable_candi = set(['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'])
for v in set(var_a):
if v in variable_candi:
ans_dict[v] = 0
candi = list(itertools.product('0123456789', repeat=len(ans_dict)))
for c in candi:
temp = var_a
for i, (k, _) in enumerate(ans_dict.items()):
temp = temp.replace(k, str(c[i]))
if len(var_a) == len(str(int(temp))):
new_elem = int(temp)
list_a.append(new_elem)
var_b = 8500
var_c = 50
var_d = var_b - var_c
list_b = []
for i in list_a:
if i >= var_d:
list_b.append(i)
var_e = 8500
var_f = 50
var_g = var_e + var_f
list_c = []
for i in list_b:
if i < var_g:
list_c.append(i)
var_h = '8A19'
var_i = 'A'
var_h = str(var_h)
var_i = str(var_i)
unk_idx = var_h.index(var_i)
var_j = 0
for elem in list_c:
elem = str(elem)
var_j = int(elem[unk_idx])
print(int(var_j))
|
8A19 [OP_GEN_POSSIBLE_LIST] 8500 50 [OP_SUB] [OP_LIST_MORE_EQUAL] 8500 50 [OP_ADD] [OP_LIST_LESS] 8A19 A [OP_LIST_FIND_UNK]
|
8500 is 8A19 rounded to the hundred place. Find the value of A.
|
8A19λ₯Ό λ°μ¬λ¦Όνμ¬ λ°±μ μ리κΉμ§ λνλ΄λ©΄ 8500μ
λλ€. Aλ₯Ό ꡬνμμ€
|
Correspondence
|
var_a = 'μ€κΈ°'
var_b = 'μ κ΅'
var_c = 'μ λ'
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 4
var_e = 6
var_f = 3
var_g = var_e + var_f
var_h = 5
list_b= []
if "/" in str(var_h):
var_h = eval(str(var_h))
list_b.append(var_h)
if "/" in str(var_g):
var_g = eval(str(var_g))
list_b.append(var_g)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_b.append(var_d)
list_b.reverse()
var_i = 1
list_c=list_b.copy()
list_c.sort()
var_j = list_c[var_i-1]
var_k = list_b.index(var_j)+1
var_l = list_a[var_k-1]
print(var_l)
|
μ€κΈ°
|
Yoongi
|
[OP_LIST_SOL] μ€κΈ° μ κ΅ μ λ [OP_LIST_EOL] [OP_LIST_SOL] 4 6 3 [OP_ADD] 5 [OP_LIST_EOL] 1 [OP_LIST_MIN] [OP_LIST_INDEX] [OP_LIST_POP] [OP_LIST_GET]
|
var_a = 'Yoongi'
var_b = 'Jungkook'
var_c = 'Yuna'
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 4
var_e = 6
var_f = 3
var_g = var_e + var_f
var_h = 5
list_b= []
if "/" in str(var_h):
var_h = eval(str(var_h))
list_b.append(var_h)
if "/" in str(var_g):
var_g = eval(str(var_g))
list_b.append(var_g)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_b.append(var_d)
list_b.reverse()
var_i = 1
list_c=list_b.copy()
list_c.sort()
var_j = list_c[var_i-1]
var_k = list_b.index(var_j)+1
var_l = list_a[var_k-1]
print(var_l)
|
[OP_LIST_SOL] Yoongi Jungkook Yuna [OP_LIST_EOL] [OP_LIST_SOL] 4 6 3 [OP_ADD] 5 [OP_LIST_EOL] 1 [OP_LIST_MIN] [OP_LIST_INDEX] [OP_LIST_POP] [OP_LIST_GET]
|
Yoongi has 4 apples, and Jungkook, who had 6 apples, got 3 more. When Yuna has 5 apples, who has the fewest apples?
|
μ€κΈ°λ μ¬κ³Όλ₯Ό 4κ°λ₯Ό κ°μ§κ³ μκ³ , 6κ°μ μ¬κ³Όλ₯Ό κ°μ§κ³ μλ μ κ΅μ΄λ 3κ°μ μ¬κ³Όλ₯Ό λ λ°μμ΅λλ€. μ λλ 5κ°μ μ¬κ³Όλ₯Ό κ°μ§κ³ μμ λ, λκ° κ°μ₯ μ¬κ³Όλ₯Ό μ κ² κ°μ§κ³ μμ΅λκΉ?
|
Comparison
|
var_a = 8.5
var_b = 2
var_c = var_a * var_b
var_d = 7.8
var_e = 2
var_f = var_d * var_e
var_g = var_c + var_f
var_h = 5
var_i = 10
var_j = var_h / var_i
var_k = 3
var_l = var_j * var_k
var_m = var_g - var_l
print('{:.2f}'.format(round(var_m+1e-10,2)))
|
31.10
|
31.1
|
8.5 2 [OP_MUL] 7.8 2 [OP_MUL] [OP_ADD] 5 10 [OP_DIV] 3 [OP_MUL] [OP_SUB]
|
var_a = 8.5
var_b = 2
var_c = var_a * var_b
var_d = 7.8
var_e = 2
var_f = var_d * var_e
var_g = var_c + var_f
var_h = 5
var_i = 10
var_j = var_h / var_i
var_k = 3
var_l = var_j * var_k
var_m = var_g - var_l
print('{:.2f}'.format(round(var_m+1e-10,2)))
|
8.5 2 [OP_MUL] 7.8 2 [OP_MUL] [OP_ADD] 5 10 [OP_DIV] 3 [OP_MUL] [OP_SUB]
|
If two 8.5 centimeters (cm) wooden planks and two 7.8 centimeters (cm) wooden planks are connected so that the overlapping part is 5 millimeters (mm), calculate how many centimeters (cm) the overall length of the planks will be.
|
8.5μΌν°λ―Έν°(γ)μ λ무 νμ 2μ₯κ³Ό 7.8μΌν°λ―Έν°(γ)μ λ무 νμ λ μ₯μ κ²ΉμΉλ λΆλΆμ΄ 5λ°λ¦¬λ―Έν°(γ)κ° λλλ‘ μ°κ²°νμ λ, λ무 νμμ μ 체 κΈΈμ΄λ λͺ μΌν°λ―Έν°(γ)κ° λλμ§ κ΅¬νμμ€.
|
Geometry
|
var_a = 2
var_b = 4
var_c = var_a + var_b
var_d = 1
var_e = var_c + var_d
var_f = 8
var_g = var_e * var_f
print(int(var_g))
|
56
|
56
|
2 4 [OP_ADD] 1 [OP_ADD] 8 [OP_MUL]
|
var_a = 2
var_b = 4
var_c = var_a + var_b
var_d = 1
var_e = var_c + var_d
var_f = 8
var_g = var_e * var_f
print(int(var_g))
|
2 4 [OP_ADD] 1 [OP_ADD] 8 [OP_MUL]
|
If there are 2 lines of people in front of Jungkook and 4 lines behind Jungkook, and the number of people standing in each line is equal to 8, how many people are standing in all?
|
μ κ΅ μμ μ¬λλ€μ΄ 2μ€μ μκ³ , μ κ΅ λ€μ 4μ€μ μκ³ , κ° μ€λ§λ€ μμλ μ¬λμ μκ° 8λͺ
μΌλ‘ κ°λ€κ³ ν λ, μ μλ μ¬λλ€μ λͺ¨λ λͺ λͺ
μ
λκΉ?
|
Comparison
|
var_a = 2
var_b = 5
var_c = 3
var_d = 7
list_a= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_e = 3
list_b = [str(i) for i in list_a]
list_b = list(itertools.permutations(list_b, var_e))
list_b = [''.join(num_list) for num_list in list_b]
list_b = [str_num for str_num in list_b if str_num[0] != '0']
list_b = [float(i) for i in list_b]
var_f = 3
list_c = []
var_f = int(var_f)
for i in list_b:
i = int(i)
if i % var_f == 0:
list_c.append(i)
var_g = 5
list_d = []
var_g = int(var_g)
for i in list_c:
i = int(i)
if i % var_g == 0:
list_d.append(i)
list_d = [float(i) for i in list_d]
var_h = sum(list_d)
print(int(var_h))
|
1110
|
1110
|
[OP_LIST_SOL] 2 5 3 7 [OP_LIST_EOL] 3 [OP_LIST_GET_PERM] 3 [OP_LIST_DIVISIBLE] 5 [OP_LIST_DIVISIBLE] [OP_LIST_SUM]
|
var_a = 2
var_b = 5
var_c = 3
var_d = 7
list_a= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_e = 3
list_b = [str(i) for i in list_a]
list_b = list(itertools.permutations(list_b, var_e))
list_b = [''.join(num_list) for num_list in list_b]
list_b = [str_num for str_num in list_b if str_num[0] != '0']
list_b = [float(i) for i in list_b]
var_f = 3
list_c = []
var_f = int(var_f)
for i in list_b:
i = int(i)
if i % var_f == 0:
list_c.append(i)
var_g = 5
list_d = []
var_g = int(var_g)
for i in list_c:
i = int(i)
if i % var_g == 0:
list_d.append(i)
list_d = [float(i) for i in list_d]
var_h = sum(list_d)
print(int(var_h))
|
[OP_LIST_SOL] 2 5 3 7 [OP_LIST_EOL] 3 [OP_LIST_GET_PERM] 3 [OP_LIST_DIVISIBLE] 5 [OP_LIST_DIVISIBLE] [OP_LIST_SUM]
|
Find the sum of all the numbers that are divisible by 3 and 5 when 3 different numbers, 2, 3, 5, and 7, are used to make a number less than or equal to 1000 and greater than 100.
|
2, 3, 5, 7 μ€ μλ‘ λ€λ₯Έ 3κ°μ μ«μλ‘ 1000μ΄ν, 100μ΄μμ μ«μλ₯Ό λ§λ€ λ 3κ³Ό 5λ‘ λλμ΄ λ¨μ΄μ§λ λͺ¨λ μμ ν©μ μνμμ€.
|
Possibility
|
var_a = 10.8
var_b = 1
var_c = 24
var_d = 60
var_e = var_c / var_d
var_f = var_b + var_e
var_g = var_a * var_f
print('{:.2f}'.format(round(var_g+1e-10,2)))
|
15.12
|
15.12
|
10.8 1 24 60 [OP_DIV] [OP_ADD] [OP_MUL]
|
var_a = 10.8
var_b = 1
var_c = 24
var_d = 60
var_e = var_c / var_d
var_f = var_b + var_e
var_g = var_a * var_f
print('{:.2f}'.format(round(var_g+1e-10,2)))
|
10.8 1 24 60 [OP_DIV] [OP_ADD] [OP_MUL]
|
Water flows out of the faucet at a rate of 10.8 liters (l) per hour. If you left the tap open for 1 hour and 24 minutes, find how many liters (L) of water flowed out.
|
μλκΌμ§μμ μκ° λΉ 10.8리ν°(L)μ© λ¬Όμ΄ νλ¬λμ¨λ€. μλκΌμ§λ₯Ό 1μκ° 24λΆ λμ μ΄μ΄ λμλ€λ©΄ λͺ 리ν°(L)μ λ¬Όμ΄ νλ¬λμλμ§ κ΅¬νμμ€.
|
Arithmetic calculation
|
var_a = 'μ€κΈ°'
var_b = 'μ κ΅'
var_c = 'μ λ'
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 4
var_e = 6
var_f = 3
var_g = var_e - var_f
var_h = 5
list_b= []
if "/" in str(var_h):
var_h = eval(str(var_h))
list_b.append(var_h)
if "/" in str(var_g):
var_g = eval(str(var_g))
list_b.append(var_g)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_b.append(var_d)
list_b.reverse()
var_i = 1
list_c=list_b.copy()
list_c.sort()
var_j = list_c[-var_i]
var_k = list_b.index(var_j)+1
var_l = list_a[var_k-1]
print(var_l)
|
μ λ
|
Yuna
|
[OP_LIST_SOL] μ€κΈ° μ κ΅ μ λ [OP_LIST_EOL] [OP_LIST_SOL] 4 6 3 [OP_SUB] 5 [OP_LIST_EOL] 1 [OP_LIST_MAX] [OP_LIST_INDEX] [OP_LIST_POP] [OP_LIST_GET]
|
var_a = 'Yoongi'
var_b = 'Jungkook'
var_c = 'Yuna'
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 4
var_e = 6
var_f = 3
var_g = var_e - var_f
var_h = 5
list_b= []
if "/" in str(var_h):
var_h = eval(str(var_h))
list_b.append(var_h)
if "/" in str(var_g):
var_g = eval(str(var_g))
list_b.append(var_g)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_b.append(var_d)
list_b.reverse()
var_i = 1
list_c=list_b.copy()
list_c.sort()
var_j = list_c[-var_i]
var_k = list_b.index(var_j)+1
var_l = list_a[var_k-1]
print(var_l)
|
[OP_LIST_SOL] Yoongi Jungkook Yuna [OP_LIST_EOL] [OP_LIST_SOL] 4 6 3 [OP_SUB] 5 [OP_LIST_EOL] 1 [OP_LIST_MAX] [OP_LIST_INDEX] [OP_LIST_POP] [OP_LIST_GET]
|
Yoongi has 4 apples and Jungkook had 6 apples, but he ate 3. If Yuna has 5 apples, who has the most apples?
|
μ€κΈ°κ° κ°μ§ μ¬κ³Όκ° 4κ°, μ κ΅μ΄λ 6κ°μ μ¬κ³Όλ₯Ό κ°μ§κ³ μμμ§λ§ 3κ°λ₯Ό λ¨Ήμμ΅λλ€. μ λκ° κ°μ§ μ¬κ³Όκ° 5κ°λΌλ©΄ λκ° κ°μ₯ λ§μ μ¬κ³Όλ₯Ό κ°μ§κ³ μλμ?
|
Comparison
|
var_a = 10
var_b = 11
var_c = 12
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 3
list_b=list_a.copy()
list_b.sort()
var_e = list_b[var_d-1]
var_f = 2
list_c=list_a.copy()
list_c.sort()
var_g = list_c[var_f-1]
var_h = var_e + var_g
print(int(var_h))
|
23
|
23
|
[OP_LIST_SOL] 10 11 12 [OP_LIST_EOL] 3 [OP_LIST_MIN] 2 [OP_LIST_MIN] [OP_ADD]
|
var_a = 10
var_b = 11
var_c = 12
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 3
list_b=list_a.copy()
list_b.sort()
var_e = list_b[var_d-1]
var_f = 2
list_c=list_a.copy()
list_c.sort()
var_g = list_c[var_f-1]
var_h = var_e + var_g
print(int(var_h))
|
[OP_LIST_SOL] 10 11 12 [OP_LIST_EOL] 3 [OP_LIST_MIN] 2 [OP_LIST_MIN] [OP_ADD]
|
There are three numbers 10, 11 and 12. What is the sum of the 3rd and 2nd smallest numbers?
|
3κ°μ μ 10, 11, 12κ° μμ΅λλ€. κ·Έ μ€μμ 3λ²μ§Έλ‘ μμ μμ 2λ²μ§Έλ‘ μμ μμ ν©μ μΌλ§μ
λκΉ?
|
Arithmetic calculation
|
var_a = 50
var_b = 70
var_c = 1
var_d = var_b - var_c
var_e = 1
list_a = [i for i in range(var_a, var_d + 1, var_e)]
var_f = 5
var_g = 3
list_b = []
var_f = int(var_f)
var_g = int(var_g)
if var_g < 0:
var_g = var_g + var_f
for i in list_a:
i = int(i)
if i%var_f == var_g:
list_b.append(i)
var_h = 7
var_i = 2
list_c = []
var_h = int(var_h)
var_i = int(var_i)
if var_i < 0:
var_i = var_i + var_h
for i in list_b:
i = int(i)
if i%var_h == var_i:
list_c.append(i)
var_j = 1
var_k = list_c[var_j-1]
print(int(var_k))
|
58
|
58
|
50 70 1 [OP_SUB] 1 [OP_LIST_ARANGE] 5 3 [OP_LIST_DIVIDE_AND_REMAIN] 7 2 [OP_LIST_DIVIDE_AND_REMAIN] 1 [OP_LIST_GET]
|
var_a = 50
var_b = 70
var_c = 1
var_d = var_b - var_c
var_e = 1
list_a = [i for i in range(var_a, var_d + 1, var_e)]
var_f = 5
var_g = 3
list_b = []
var_f = int(var_f)
var_g = int(var_g)
if var_g < 0:
var_g = var_g + var_f
for i in list_a:
i = int(i)
if i%var_f == var_g:
list_b.append(i)
var_h = 7
var_i = 2
list_c = []
var_h = int(var_h)
var_i = int(var_i)
if var_i < 0:
var_i = var_i + var_h
for i in list_b:
i = int(i)
if i%var_h == var_i:
list_c.append(i)
var_j = 1
var_k = list_c[var_j-1]
print(int(var_k))
|
50 70 1 [OP_SUB] 1 [OP_LIST_ARANGE] 5 3 [OP_LIST_DIVIDE_AND_REMAIN] 7 2 [OP_LIST_DIVIDE_AND_REMAIN] 1 [OP_LIST_GET]
|
There is a number that is greater than 50 and less than 70. Also, this number has a remainder of 3 when divided by 5, a remainder of 2 when divided by 7, and a remainder of 2 when divided by 8. What is this number?
|
μ΄λ€ μλ 50λ³΄λ€ ν¬κ³ 70λ³΄λ€ μμ΅λλ€. λν μ΄ μλ 5λ‘ λλμμ λ λλ¨Έμ§κ° 3μ΄κ³ 7λ‘ λλμμ λ λλ¨Έμ§κ° 2μ΄κ³ 8λ‘ λλμμ λ λλ¨Έμ§κ° 2μ
λλ€. μ΄ μλ 무μμ
λκΉ?
|
Correspondence
|
var_a = '건μ'
var_b = 'μν'
list_a= []
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_c = 0.3333333333333333
var_d = 0.4444444444444444
list_b= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_b.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_b.append(var_c)
list_b.reverse()
var_e = 1
list_c=list_b.copy()
list_c.sort()
var_f = list_c[-var_e]
var_g = list_b.index(var_f)+1
var_h = list_a[var_g-1]
print(var_h)
|
μν
|
Suhwan
|
[OP_LIST_SOL] 건μ μν [OP_LIST_EOL] [OP_LIST_SOL] 1/3 4/9 [OP_LIST_EOL] 1 [OP_LIST_MAX] [OP_LIST_INDEX] [OP_LIST_POP] [OP_LIST_GET]
|
var_a = 'Kunyoung'
var_b = 'Suhwan'
list_a= []
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_c = 0.3333333333333333
var_d = 0.4444444444444444
list_b= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_b.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_b.append(var_c)
list_b.reverse()
var_e = 1
list_c=list_b.copy()
list_c.sort()
var_f = list_c[-var_e]
var_g = list_b.index(var_f)+1
var_h = list_a[var_g-1]
print(var_h)
|
[OP_LIST_SOL] Kunyoung Suhwan [OP_LIST_EOL] [OP_LIST_SOL] 1/3 4/9 [OP_LIST_EOL] 1 [OP_LIST_MAX] [OP_LIST_INDEX] [OP_LIST_POP] [OP_LIST_GET]
|
There is a book of 270 pages. If Kunyoung read 1/3 of the total in one day and Suhwan read 4/9 of the total, find out who read more books in a day.
|
270μͺ½μ μ±
μ΄ μμ΅λλ€. 건μμ΄λ ν루 λμ μ 체μ 1/3μ μ½μκ³ , μνμ΄λ μ 체μ 4/9λ₯Ό μ½μλ€λ©΄, ν루 λμ μ±
μ λ λ§μ΄ μ½μ μ¬λμ λꡬμΈμ§ ꡬνμμ€.
|
Comparison
|
var_a = 63
var_b = 27
var_c = var_a + var_b
var_d = 78
var_e = var_c - var_d
print(int(var_e))
|
12
|
12
|
63 27 [OP_ADD] 78 [OP_SUB]
|
var_a = 63
var_b = 27
var_c = var_a + var_b
var_d = 78
var_e = var_c - var_d
print(int(var_e))
|
63 27 [OP_ADD] 78 [OP_SUB]
|
There were 78 people on the train. Of these, 27 got off and a few got on, making the total people in the train to 63. How many people got on the train?
|
κΈ°μ°¨μ 78λͺ
μ΄ νκ³ μμμ΅λλ€. μ΄ μ€μμ 27λͺ
μ΄ λ΄λ¦¬κ³ λͺ λͺ
μ΄ νμ 63λͺ
μ΄ λμμ΅λλ€. κΈ°μ°¨μ ν μ¬λμ λͺ λͺ
μ
λκΉ?
|
Arithmetic calculation
|
var_a = '32BA33'
ans_dict = dict()
var_a = str(var_a)
list_a = []
variable_candi = set(['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'])
for v in set(var_a):
if v in variable_candi:
ans_dict[v] = 0
candi = list(itertools.product('0123456789', repeat=len(ans_dict)))
for c in candi:
temp = var_a
for i, (k, _) in enumerate(ans_dict.items()):
temp = temp.replace(k, str(c[i]))
if len(var_a) == len(str(int(temp))):
new_elem = int(temp)
list_a.append(new_elem)
var_b = 323400
var_c = 50
var_d = var_b - var_c
list_b = []
for i in list_a:
if i >= var_d:
list_b.append(i)
var_e = 323400
var_f = 50
var_g = var_e + var_f
list_c = []
for i in list_b:
if i < var_g:
list_c.append(i)
var_h = '32BA33'
var_i = 'A'
var_h = str(var_h)
var_i = str(var_i)
unk_idx = var_h.index(var_i)
var_j = 0
for elem in list_c:
elem = str(elem)
var_j = int(elem[unk_idx])
print(int(var_j))
|
4
|
4
|
32BA33 [OP_GEN_POSSIBLE_LIST] 323400 50 [OP_SUB] [OP_LIST_MORE_EQUAL] 323400 50 [OP_ADD] [OP_LIST_LESS] 32BA33 A [OP_LIST_FIND_UNK]
|
var_a = '32BA33'
ans_dict = dict()
var_a = str(var_a)
list_a = []
variable_candi = set(['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'])
for v in set(var_a):
if v in variable_candi:
ans_dict[v] = 0
candi = list(itertools.product('0123456789', repeat=len(ans_dict)))
for c in candi:
temp = var_a
for i, (k, _) in enumerate(ans_dict.items()):
temp = temp.replace(k, str(c[i]))
if len(var_a) == len(str(int(temp))):
new_elem = int(temp)
list_a.append(new_elem)
var_b = 323400
var_c = 50
var_d = var_b - var_c
list_b = []
for i in list_a:
if i >= var_d:
list_b.append(i)
var_e = 323400
var_f = 50
var_g = var_e + var_f
list_c = []
for i in list_b:
if i < var_g:
list_c.append(i)
var_h = '32BA33'
var_i = 'A'
var_h = str(var_h)
var_i = str(var_i)
unk_idx = var_h.index(var_i)
var_j = 0
for elem in list_c:
elem = str(elem)
var_j = int(elem[unk_idx])
print(int(var_j))
|
32BA33 [OP_GEN_POSSIBLE_LIST] 323400 50 [OP_SUB] [OP_LIST_MORE_EQUAL] 323400 50 [OP_ADD] [OP_LIST_LESS] 32BA33 A [OP_LIST_FIND_UNK]
|
There is a number 32BA33. If this number is rounded to the nearest hundred, it is 323400. What is A?
|
μ«μ 32BA33μ΄ μμ΅λλ€. μ΄ μ«μλ₯Ό λ°μ¬λ¦Ό νμ¬ λ°±μ μ리κΉμ§ λνλ΄λ©΄ 323400μ
λλ€. Aλ 무μμ
λκΉ?
|
Correspondence
|
var_a = 0.8333333333333334
var_b = 1.5833333333333333
var_c = var_a + var_b
print('{:.2f}'.format(round(var_c+1e-10,2)))
|
2.42
|
2.42
|
5/6 19/12 [OP_ADD]
|
var_a = 0.8333333333333334
var_b = 1.5833333333333333
var_c = var_a + var_b
print('{:.2f}'.format(round(var_c+1e-10,2)))
|
5/6 19/12 [OP_ADD]
|
There are 5/6 and 19/12. What is the sum of them?
|
5/6κ³Ό 19/12κ° μμ΅λλ€. μ΄λ€μ λͺ¨λ λνλ©΄ μΌλ§μΈκ°μ?
|
Arithmetic calculation
|
var_a = 3
print(int(var_a))
|
3
|
3
|
3
|
var_a = 3
print(int(var_a))
|
3
|
Find the number of faces of a cuboid that meet at a vertex.
|
μ§μ‘면체μ ν μ μμ λ§λλ λ©΄μ κ°μλ₯Ό ꡬνμμ€.
|
Geometry
|
var_a = 1.4
var_b = 0.9
var_c = 1.2
var_d = 0.5
var_e = 1.3
list_a= []
if "/" in str(var_e):
var_e = eval(str(var_e))
list_a.append(var_e)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_f = 1.1
list_b = []
for i in list_a:
if i <= var_f:
list_b.append(i)
var_g = len(list_b)
print(int(var_g))
|
2
|
2
|
[OP_LIST_SOL] 1.4 9/10 1.2 0.5 13/10 [OP_LIST_EOL] 1.1 [OP_LIST_LESS_EQUAL] [OP_LIST_LEN]
|
var_a = 1.4
var_b = 0.9
var_c = 1.2
var_d = 0.5
var_e = 1.3
list_a= []
if "/" in str(var_e):
var_e = eval(str(var_e))
list_a.append(var_e)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_f = 1.1
list_b = []
for i in list_a:
if i <= var_f:
list_b.append(i)
var_g = len(list_b)
print(int(var_g))
|
[OP_LIST_SOL] 1.4 9/10 1.2 0.5 13/10 [OP_LIST_EOL] 1.1 [OP_LIST_LESS_EQUAL] [OP_LIST_LEN]
|
Out of 5 numbers: 1.4, 9/10, 1.2, 0.5, 13/10, how many are less than or equal to 1.1?
|
μ 5κ° 1.4, 9/10, 1.2, 0.5, 13/10 μ€ 1.1λ³΄λ€ μκ±°λ κ°μ μ«μλ₯Ό ꡬνλ©΄, λͺ κ°μΈκ°μ?
|
Comparison
|
var_a = 12
var_b = 4
var_c = var_a * var_b
var_d = 3
var_e = var_c + var_d
var_f = 12
var_g = var_e - var_f
var_h = 12
var_i = var_g + var_h
var_j = 4
var_k = var_i * var_j
print(int(var_k))
|
204
|
204
|
12 4 [OP_MUL] 3 [OP_ADD] 12 [OP_SUB] 12 [OP_ADD] 4 [OP_MUL]
|
var_a = 12
var_b = 4
var_c = var_a * var_b
var_d = 3
var_e = var_c + var_d
var_f = 12
var_g = var_e - var_f
var_h = 12
var_i = var_g + var_h
var_j = 4
var_k = var_i * var_j
print(int(var_k))
|
12 4 [OP_MUL] 3 [OP_ADD] 12 [OP_SUB] 12 [OP_ADD] 4 [OP_MUL]
|
When you add 12 to a number and divide it by 4, the quotient is 12 and the remainder is 3. Add 12 to that number in question and multiply it by 4 to find the value.
|
μ΄λ€ μμ 12λ₯Ό λν λ€ 4λ‘ λλμλλ λͺ«μ΄ 12μ΄κ³ λλ¨Έμ§κ° 3μ΄ λμμ΅λλ€. μ΄λ€ μμ 12λ₯Ό λνκ³ 4λ₯Ό κ³±ν κ°μ ꡬνμμ€.
|
Correspondence
|
var_a = 'μλ§'
var_b = 'μλΉ '
var_c = 'ν μλ²μ§'
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 'μλ§'
var_e = list_a.index(var_d)+1
print(int(var_e))
|
1
|
1
|
[OP_LIST_SOL] μλ§ μλΉ ν μλ²μ§ [OP_LIST_EOL] μλ§ [OP_LIST_INDEX]
|
var_a = 'Mom'
var_b = 'Dad'
var_c = 'Grandpa'
list_a= []
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_d = 'Mom'
var_e = list_a.index(var_d)+1
print(int(var_e))
|
[OP_LIST_SOL] Mom Dad Grandpa [OP_LIST_EOL] Mom [OP_LIST_INDEX]
|
Mom, Dad, and Grandpa bought clothes at the department store. Dad bought more clothes than Mom, and Grandpa bought more clothes than Dad. If you lined up people based on the number of clothes they bought in ascending order, in what position will Mom be? Please answer using an natural number.
|
μλ§, μλΉ , ν μλ²μ§κ° λ°±νμ μμ μ·μ ꡬ맀νμ΅λλ€. μλ§λ³΄λ€ μλΉ κ° μ·μ λ λ§μ΄ μκ³ , μλΉ λ³΄λ€ ν μλ²μ§κ° μ·μ λ λ§μ΄ μμ΅λλ€. μλ§λ λͺ λ²μ§Έλ‘ μ·μ μ κ² μμ΅λκΉ?
|
Comparison
|
var_a = 6
var_b = 100
var_c = 2
var_d = var_b ** var_c
var_e = var_a * var_d
var_f = 150
var_g = var_e / var_f
print(int(var_g))
|
400
|
400
|
6 100 2 [OP_POW] [OP_MUL] 150 [OP_DIV]
|
var_a = 6
var_b = 100
var_c = 2
var_d = var_b ** var_c
var_e = var_a * var_d
var_f = 150
var_g = var_e / var_f
print(int(var_g))
|
6 100 2 [OP_POW] [OP_MUL] 150 [OP_DIV]
|
If the width of a rectangle with an area of 6 square meters (m2) is 150 centimeters (cm), what is the length in centimeters (cm)?
|
λμ΄κ° 6μ κ³±λ―Έν°(γ‘)μΈ μ§μ¬κ°νμ κ°λ‘μ κΈΈμ΄κ° 150μΌν°λ―Έν°(γ)μ΄λ©΄, μΈλ‘μ κΈΈμ΄λ λͺ μΌν°λ―Έν°(γ)μ
λκΉ?
|
Geometry
|
var_a = 2
var_b = 'μ¬κ³Ό'
var_c = '볡μμ'
var_d = 'λ°°'
var_e = 'μ°ΈμΈ'
list_a= []
if "/" in str(var_e):
var_e = eval(str(var_e))
list_a.append(var_e)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
list_a.reverse()
var_f = len(list_a)
var_g = var_a ** var_f
print(int(var_g))
|
16
|
16
|
2 [OP_LIST_SOL] μ¬κ³Ό 볡μμ λ°° μ°ΈμΈ [OP_LIST_EOL] [OP_LIST_LEN] [OP_POW]
|
var_a = 2
var_b = 'Apple'
var_c = 'Peach'
var_d = 'Pear'
var_e = 'Melon'
list_a= []
if "/" in str(var_e):
var_e = eval(str(var_e))
list_a.append(var_e)
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
list_a.reverse()
var_f = len(list_a)
var_g = var_a ** var_f
print(int(var_g))
|
2 [OP_LIST_SOL] Apple Peach Pear Melon [OP_LIST_EOL] [OP_LIST_LEN] [OP_POW]
|
We are going to divide Apples, Peaches, Pears, and Melons into two fruit baskets. How many possible cases are there?
|
μ¬κ³Ό, 볡μμ, λ°°, μ°ΈμΈλ₯Ό 2κ°μ κ³ΌμΌ λ°κ΅¬λμ λλμ΄ λ΄μΌλ €κ³ ν©λλ€. κ°λ₯ν κ²½μ°μ μλ λͺ¨λ λͺ κ°μ§μ
λκΉ?
|
Possibility
|
var_a = 1
var_b = 3
var_c = var_a + var_b
var_d = 1
var_e = 3
var_f = var_d + var_e
var_g = 1
var_c = int(var_c)
var_f = int(var_f)
for i, elem in enumerate(range(var_f)):
var_g = var_g * (var_c-i)
var_h = 2
var_i = 2
var_j = 1
var_h = int(var_h)
var_i = int(var_i)
for i, elem in enumerate(range(var_i)):
var_j = var_j * (var_h-i)
var_k = var_g * var_j
print(int(var_k))
|
48
|
48
|
1 3 [OP_ADD] 1 3 [OP_ADD] [OP_PERM] 2 2 [OP_PERM] [OP_MUL]
|
var_a = 1
var_b = 3
var_c = var_a + var_b
var_d = 1
var_e = 3
var_f = var_d + var_e
var_g = 1
var_c = int(var_c)
var_f = int(var_f)
for i, elem in enumerate(range(var_f)):
var_g = var_g * (var_c-i)
var_h = 2
var_i = 2
var_j = 1
var_h = int(var_h)
var_i = int(var_i)
for i, elem in enumerate(range(var_i)):
var_j = var_j * (var_h-i)
var_k = var_g * var_j
print(int(var_k))
|
1 3 [OP_ADD] 1 3 [OP_ADD] [OP_PERM] 2 2 [OP_PERM] [OP_MUL]
|
When 2 female students and 3 male students are lined up in a row, find the number of cases where the female students must stand next to each other.
|
μ¬νμ 2λͺ
, λ¨νμ 3λͺ
μ ν μ€λ‘ μΈμΈ λ, μ¬νμλΌλ¦¬λ λ°λμ μ΄μνκ² μΈμ°λ κ²½μ°μ μλ₯Ό ꡬνμμ€.
|
Possibility
|
var_a = 5
var_b = 1
var_c = 1
var_d = var_b + var_c
var_e = 1
var_a = int(var_a)
var_d = int(var_d)
for i, elem in enumerate(range(var_d)):
var_e = var_e * (var_a-i)
print(int(var_e))
|
20
|
20
|
5 1 1 [OP_ADD] [OP_PERM]
|
var_a = 5
var_b = 1
var_c = 1
var_d = var_b + var_c
var_e = 1
var_a = int(var_a)
var_d = int(var_d)
for i, elem in enumerate(range(var_d)):
var_e = var_e * (var_a-i)
print(int(var_e))
|
5 1 1 [OP_ADD] [OP_PERM]
|
Find the number of ways in which one president and one secretary are selected from five different people.
|
μλ‘ λ€λ₯Έ λ€μ― λͺ
μ μ¬λ μ€ νμ₯ 1λͺ
κ³Ό μ΄λ¬΄ 1λͺ
μ λ½λ κ²½μ°μ μλ₯Ό ꡬνμμ€.
|
Possibility
|
var_a = 60
var_b = 0.6
var_c = var_a // var_b
print(int(var_c))
|
100
|
100
|
60 0.6 [OP_FDIV]
|
var_a = 60
var_b = 0.6
var_c = var_a // var_b
print(int(var_c))
|
60 0.6 [OP_FDIV]
|
You want to cut a string that is 60 meters (m) long into 0.6 meters (m) each. How many pieces of string can you cut in total?
|
κΈΈμ΄κ° 60λ―Έν°(m)μΈ λμ 0.6λ―Έν°(m)μ© λͺ¨λ μλ₯΄λ €κ³ ν©λλ€. λμ λͺ¨λ λͺ κ°λ‘ μλ₯Ό μ μμ΅λκΉ?
|
Arithmetic calculation
|
var_a = 4
var_b = 4
var_c = var_a * var_b
var_d = 2
var_e = var_c / var_d
print(int(var_e))
|
8
|
8
|
4 4 [OP_MUL] 2 [OP_DIV]
|
var_a = 4
var_b = 4
var_c = var_a * var_b
var_d = 2
var_e = var_c / var_d
print(int(var_e))
|
4 4 [OP_MUL] 2 [OP_DIV]
|
A rhombus is formed by joining the points that divide each of the four sides of a square into two halves. If the side of a square is 4 centimeters (cm), what is the area of the rhombus in square centimeters (cm2)?
|
μ΄λ€ μ μ¬κ°νμ λ€ λ³μ κ°κ° λλ‘ λλ μ λ€μ μ΄μ΄ λ§λ¦λͺ¨λ₯Ό λ§λ€μμ΅λλ€. μ΄λ€ μ μ¬κ°νμ λ³μ κΈΈμ΄κ° 4μΌν°λ―Έν°(γ)λΌκ³ ν λ, λ§λ¦λͺ¨μ λμ΄λ λͺ μ κ³±μΌν°λ―Έν°(γ )μ
λκΉ?
|
Geometry
|
var_a = 'A'
var_b = 'B'
var_c = 'C'
var_d = 'D'
list_a= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_e = 'A'
var_f = 'D'
var_g = '>'
var_h = 'B'
var_i = 'A'
var_j = '>'
var_k = 'C'
var_l = 'A'
var_m = '<'
var_n = 'C'
var_o = 'B'
var_p = '<'
var_q = 'C'
var_r = 'D'
var_s = '<'
list_b= []
if "/" in str(var_s):
var_s = eval(str(var_s))
list_b.append(var_s)
if "/" in str(var_r):
var_r = eval(str(var_r))
list_b.append(var_r)
if "/" in str(var_q):
var_q = eval(str(var_q))
list_b.append(var_q)
if "/" in str(var_p):
var_p = eval(str(var_p))
list_b.append(var_p)
if "/" in str(var_o):
var_o = eval(str(var_o))
list_b.append(var_o)
if "/" in str(var_n):
var_n = eval(str(var_n))
list_b.append(var_n)
if "/" in str(var_m):
var_m = eval(str(var_m))
list_b.append(var_m)
if "/" in str(var_l):
var_l = eval(str(var_l))
list_b.append(var_l)
if "/" in str(var_k):
var_k = eval(str(var_k))
list_b.append(var_k)
if "/" in str(var_j):
var_j = eval(str(var_j))
list_b.append(var_j)
if "/" in str(var_i):
var_i = eval(str(var_i))
list_b.append(var_i)
if "/" in str(var_h):
var_h = eval(str(var_h))
list_b.append(var_h)
if "/" in str(var_g):
var_g = eval(str(var_g))
list_b.append(var_g)
if "/" in str(var_f):
var_f = eval(str(var_f))
list_b.append(var_f)
if "/" in str(var_e):
var_e = eval(str(var_e))
list_b.append(var_e)
list_b.reverse()
global item_name_index_dict
items_name_list = list_a.copy()
conditions = []
condition_list = list_b.copy()
temp_stack = []
for index_, cond_ in enumerate(map(str, condition_list)):
if cond_ in ("<", ">", "="):
operand_right = temp_stack.pop()
operand_left = temp_stack.pop()
if cond_ == "=":
cond_ = "=="
conditions.append(f"{operand_left} {cond_} {operand_right}")
else:
if not cond_.isdigit():
cond_ = "{" + cond_ + "}"
temp_stack.append(cond_)
item_name_index_dict = {}
for perm in itertools.permutations(range(1, len(items_name_list) + 1)):
item_name_index_dict = dict(zip(items_name_list, perm))
formatted_conditions = \
[condition.format_map(item_name_index_dict) for condition in conditions]
if all(map(eval, formatted_conditions)):
break
list_c = list(item_name_index_dict.keys())
list_c.sort(key=item_name_index_dict.get, reverse=True)
var_t = 1
var_u = list_c[var_t-1]
print(var_u)
|
B
|
B
|
[OP_LIST_SOL] A B C D [OP_LIST_EOL] [OP_LIST_SOL] A D > B A > C A < C B < C D < [OP_LIST_EOL] [OP_LIST_COND_MAX_MIN] 1 [OP_LIST_GET]
|
var_a = 'A'
var_b = 'B'
var_c = 'C'
var_d = 'D'
list_a= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_e = 'A'
var_f = 'D'
var_g = '>'
var_h = 'B'
var_i = 'A'
var_j = '>'
var_k = 'C'
var_l = 'A'
var_m = '<'
var_n = 'C'
var_o = 'B'
var_p = '<'
var_q = 'C'
var_r = 'D'
var_s = '<'
list_b= []
if "/" in str(var_s):
var_s = eval(str(var_s))
list_b.append(var_s)
if "/" in str(var_r):
var_r = eval(str(var_r))
list_b.append(var_r)
if "/" in str(var_q):
var_q = eval(str(var_q))
list_b.append(var_q)
if "/" in str(var_p):
var_p = eval(str(var_p))
list_b.append(var_p)
if "/" in str(var_o):
var_o = eval(str(var_o))
list_b.append(var_o)
if "/" in str(var_n):
var_n = eval(str(var_n))
list_b.append(var_n)
if "/" in str(var_m):
var_m = eval(str(var_m))
list_b.append(var_m)
if "/" in str(var_l):
var_l = eval(str(var_l))
list_b.append(var_l)
if "/" in str(var_k):
var_k = eval(str(var_k))
list_b.append(var_k)
if "/" in str(var_j):
var_j = eval(str(var_j))
list_b.append(var_j)
if "/" in str(var_i):
var_i = eval(str(var_i))
list_b.append(var_i)
if "/" in str(var_h):
var_h = eval(str(var_h))
list_b.append(var_h)
if "/" in str(var_g):
var_g = eval(str(var_g))
list_b.append(var_g)
if "/" in str(var_f):
var_f = eval(str(var_f))
list_b.append(var_f)
if "/" in str(var_e):
var_e = eval(str(var_e))
list_b.append(var_e)
list_b.reverse()
global item_name_index_dict
items_name_list = list_a.copy()
conditions = []
condition_list = list_b.copy()
temp_stack = []
for index_, cond_ in enumerate(map(str, condition_list)):
if cond_ in ("<", ">", "="):
operand_right = temp_stack.pop()
operand_left = temp_stack.pop()
if cond_ == "=":
cond_ = "=="
conditions.append(f"{operand_left} {cond_} {operand_right}")
else:
if not cond_.isdigit():
cond_ = "{" + cond_ + "}"
temp_stack.append(cond_)
item_name_index_dict = {}
for perm in itertools.permutations(range(1, len(items_name_list) + 1)):
item_name_index_dict = dict(zip(items_name_list, perm))
formatted_conditions = \
[condition.format_map(item_name_index_dict) for condition in conditions]
if all(map(eval, formatted_conditions)):
break
list_c = list(item_name_index_dict.keys())
list_c.sort(key=item_name_index_dict.get, reverse=True)
var_t = 1
var_u = list_c[var_t-1]
print(var_u)
|
[OP_LIST_SOL] A B C D [OP_LIST_EOL] [OP_LIST_SOL] A D > B A > C A < C B < C D < [OP_LIST_EOL] [OP_LIST_COND_MAX_MIN] 1 [OP_LIST_GET]
|
The shop sells gems A, B, C, and D. A is more expensive than D, and B is more expensive than A. When C is the cheapest, which gem is the most expensive?
|
μμ μμ 보μ A, B, C, Dλ₯Ό νκ³ μμ΅λλ€. Aλ Dλ³΄λ€ λΉμΈκ³ , Bλ Aλ³΄λ€ λΉμλλ€. Cκ° κ°μ₯ μ λ, κ°μ₯ λΉμΌ 보μμ 무μμΈκ°μ?
|
Comparison
|
var_a = 31
var_b = 13
var_c = var_a + var_b
var_d = 11
var_e = var_c + var_d
print(int(var_e))
|
55
|
55
|
31 13 [OP_ADD] 11 [OP_ADD]
|
var_a = 31
var_b = 13
var_c = var_a + var_b
var_d = 11
var_e = var_c + var_d
print(int(var_e))
|
31 13 [OP_ADD] 11 [OP_ADD]
|
31 is the result of subtracting 13 from a number. What is this number when 11 is added?
|
31μ μ΄λ€μμμ 13μ λΊ μ«μμ
λλ€. μ΄λ€ μμμ 11μ λνλ©΄ μΌλ§μ
λκΉ?
|
Correspondence
|
var_a = 1
var_b = 9
var_c = 1
list_a = [i for i in range(var_a, var_b + 1, var_c)]
var_d = 57
var_e = 7
var_f = var_d * var_e
var_g = 65
var_h = var_f / var_g
list_b = []
for i in list_a:
if i < var_h:
list_b.append(i)
var_i = len(list_b)
print(int(var_i))
|
6
|
6
|
1 9 1 [OP_LIST_ARANGE] 57 7 [OP_MUL] 65 [OP_DIV] [OP_LIST_LESS] [OP_LIST_LEN]
|
var_a = 1
var_b = 9
var_c = 1
list_a = [i for i in range(var_a, var_b + 1, var_c)]
var_d = 57
var_e = 7
var_f = var_d * var_e
var_g = 65
var_h = var_f / var_g
list_b = []
for i in list_a:
if i < var_h:
list_b.append(i)
var_i = len(list_b)
print(int(var_i))
|
1 9 1 [OP_LIST_ARANGE] 57 7 [OP_MUL] 65 [OP_DIV] [OP_LIST_LESS] [OP_LIST_LEN]
|
A can contain natural numbers from 1 to 9. If 57Γ7>65ΓA, how many numbers can fit in A?
|
Aμλ 1λΆν° 9κΉμ§μ μμ°μκ° λ€μ΄κ° μ μμ΅λλ€. 57Γ7>65ΓAμΌ λ, Aμ λ€μ΄κ° μ μλ μλ λͺ¨λ λͺ κ°μ
λκΉ?
|
Possibility
|
var_a = 'TV'
var_b = 'λμ₯κ³ '
var_c = 'μΈνκΈ°'
var_d = 'μ»΄ν¨ν°'
list_a= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_e = len(list_a)
var_f = 1
var_g = 1
var_e = int(var_e)
var_f = int(var_f)
for i, elem in enumerate(range(var_f)):
var_g = var_g * (var_e-i)
for i, elem in enumerate(range(var_f)):
var_g = var_g / (i+1)
print(int(var_g))
|
4
|
4
|
[OP_LIST_SOL] TV λμ₯κ³ μΈνκΈ° μ»΄ν¨ν° [OP_LIST_EOL] [OP_LIST_LEN] 1 [OP_COMB]
|
var_a = 'TV'
var_b = 'refrigerator'
var_c = 'washer'
var_d = 'computer'
list_a= []
if "/" in str(var_d):
var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_e = len(list_a)
var_f = 1
var_g = 1
var_e = int(var_e)
var_f = int(var_f)
for i, elem in enumerate(range(var_f)):
var_g = var_g * (var_e-i)
for i, elem in enumerate(range(var_f)):
var_g = var_g / (i+1)
print(int(var_g))
|
[OP_LIST_SOL] TV refrigerator washer computer [OP_LIST_EOL] [OP_LIST_LEN] 1 [OP_COMB]
|
Hyejeong wants to replace one product out of the TV, refrigerator, washer, and computer. How many ways are there for Hyejeong to choose one product to replace?
|
νμ μ΄λ TV, λμ₯κ³ , μΈνκΈ°, μ»΄ν¨ν° μ€μμ ν κ°μ§ μ νμ κ΅μ²΄νλ €κ³ νλ€. νμ μ΄κ° κ΅μ²΄ν μ μλ ν κ°μ§ μ νμ μ ννλ κ²½μ°μ μλ?
|
Possibility
|
var_a = 158760
var_b = 140
var_c = var_a / var_b
print(int(var_c))
|
1134
|
1134
|
158760 140 [OP_DIV]
|
var_a = 158760
var_b = 140
var_c = var_a / var_b
print(int(var_c))
|
158760 140 [OP_DIV]
|
If you converted $140 to 158760 Korean Won, how much is $1 in Korean Won?
|
140λ¬λ¬λ₯Ό μ°λ¦¬λλΌ λ 158760μμΌλ‘ λ°κΏ¨μ λ 1λ¬λ¬λ μ°λ¦¬λλΌ λμΌλ‘ μΌλ§μ
λκΉ?
|
Arithmetic calculation
|
var_a = 2
var_b = 3
list_a= []
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_c = 3
list_b = [str(i) for i in list_a]
list_b = list(itertools.product(list_b, repeat=var_c))
list_b = [''.join(num_list) for num_list in list_b]
list_b = [str_num for str_num in list_b if str_num[0] != '0']
list_b = [float(i) for i in list_b]
var_d = len(list_b)
print(int(var_d))
|
8
|
8
|
[OP_LIST_SOL] 2 3 [OP_LIST_EOL] 3 [OP_LIST_GET_PRODUCT] [OP_LIST_LEN]
|
var_a = 2
var_b = 3
list_a= []
if "/" in str(var_b):
var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_c = 3
list_b = [str(i) for i in list_a]
list_b = list(itertools.product(list_b, repeat=var_c))
list_b = [''.join(num_list) for num_list in list_b]
list_b = [str_num for str_num in list_b if str_num[0] != '0']
list_b = [float(i) for i in list_b]
var_d = len(list_b)
print(int(var_d))
|
[OP_LIST_SOL] 2 3 [OP_LIST_EOL] 3 [OP_LIST_GET_PRODUCT] [OP_LIST_LEN]
|
There is a card with three digits where each digit only consists of numbers 2 and 3. How many possible cards are there?
|
κ° μ리 μ«μκ° 2μ 3μΌλ‘λ§ μ΄λ£¨μ΄μ§ μΈ μ리 μκ° μ ν μΉ΄λκ° μμ΅λλ€. κ°λ₯ν μΉ΄λμ κ°μλ λͺ¨λ λͺ κ°μ
λκΉ?
|
Possibility
|
var_a = 46
var_b = 2
var_c = var_a / var_b
var_d = 9
var_e = var_c - var_d
print(int(var_e))
|
14
|
14
|
46 2 [OP_DIV] 9 [OP_SUB]
|
var_a = 46
var_b = 2
var_c = var_a / var_b
var_d = 9
var_e = var_c - var_d
print(int(var_e))
|
46 2 [OP_DIV] 9 [OP_SUB]
|
The rectangular-shaped cell phone is 9 centimeters (cm) wide and 46 centimeters (cm) in circumference. Find the vertical length of the cell phone.
|
μ§μ¬κ°ν λͺ¨μμ ν΄λν°μ κ°λ‘κ° 9μΌν°λ―Έν°(γ)μ΄κ³ λλ κ° 46μΌν°λ―Έν°(γ)μ΄λ€. ν΄λν°μ κ°λ‘μ κΈΈμ΄λ₯Ό ꡬνμμ€.
|
Geometry
|
var_a = 6
var_b = 2
var_c = 1
var_a = int(var_a)
var_b = int(var_b)
for i, elem in enumerate(range(var_b)):
var_c = var_c * (var_a-i)
print(int(var_c))
|
30
|
30
|
6 2 [OP_PERM]
|
var_a = 6
var_b = 2
var_c = 1
var_a = int(var_a)
var_b = int(var_b)
for i, elem in enumerate(range(var_b)):
var_c = var_c * (var_a-i)
print(int(var_c))
|
6 2 [OP_PERM]
|
There are 6 colored pencils, all of different colors, in the pencil case. If you draw two and lend one to the friend in front and the other to the friend in the back, how many possible situations are there?
|
νν΅ μμ μκΉμ΄ λͺ¨λ λ€λ₯Έ μμ°νμ΄ 6μ루 μλ€. λ κ°λ₯Ό λ½μ νλλ μμ μΉκ΅¬μκ², λ€λ₯Έ νλλ λ€μ μΉκ΅¬μκ² λΉλ €μ€ λ, κ°λ₯ν μν©μ λͺ¨λ λͺ κ°μ§κ° μλκ°?
|
Possibility
|
var_a = 9
var_b = 9
var_c = var_a - var_b
var_d = 1
var_e = var_c + var_d
print(int(var_e))
|
1
|
1
|
9 9 [OP_SUB] 1 [OP_ADD]
|
var_a = 9
var_b = 9
var_c = var_a - var_b
var_d = 1
var_e = var_c + var_d
print(int(var_e))
|
9 9 [OP_SUB] 1 [OP_ADD]
|
Nine people are standing in a line in order of height from shortest to tallest. Hoseok is the shortest. If the people line up again in order of height from the tallest to the shortest, in what number from the back will Hoseok stand?
|
ν€κ° μμ μ¬λλΆν° μμλλ‘ 9λͺ
μ΄ ν μ€λ‘ μ μμ΅λλ€. νΈμμ΄κ° κ°μ₯ ν€κ° μμ΅λλ€. ν€κ° ν° μ¬λλΆν° μμλλ‘ λ€μ μ€μ μλ©΄ νΈμμ΄λ λ€μμλΆν° λͺ λ²μ§Έμ μκ² λ©λκΉ?
|
Comparison
|
var_a = 6
var_b = 1
var_c = -3
var_d = var_b / var_c
var_e = var_a * var_d
var_f = 8
var_g = 2
var_h = 4
var_i = var_g / var_h
var_j = var_f * var_i
var_k = var_e - var_j
var_l = 1
var_m = 3
var_n = 0.5
var_o = var_m / var_n
var_p = var_l * var_o
var_q = var_k + var_p
print(int(var_q))
|
0
|
0
|
6 1 -3 [OP_DIV] [OP_MUL] 8 2 4 [OP_DIV] [OP_MUL] [OP_SUB] 1 3 1/2 [OP_DIV] [OP_MUL] [OP_ADD]
|
var_a = 6
var_b = 1
var_c = -3
var_d = var_b / var_c
var_e = var_a * var_d
var_f = 8
var_g = 2
var_h = 4
var_i = var_g / var_h
var_j = var_f * var_i
var_k = var_e - var_j
var_l = 1
var_m = 3
var_n = 0.5
var_o = var_m / var_n
var_p = var_l * var_o
var_q = var_k + var_p
print(int(var_q))
|
6 1 -3 [OP_DIV] [OP_MUL] 8 2 4 [OP_DIV] [OP_MUL] [OP_SUB] 1 3 1/2 [OP_DIV] [OP_MUL] [OP_ADD]
|
When 1/A=-3, 2/B=4, 3/C=1/2, find the value of 6A-8B+C
|
1/A=-3, 2/B=4, 3/C=1/2μΌ λ, 6A-8B+Cμ κ°μ ꡬνμ¬λΌ
|
Correspondence
|
var_a = 28
list_a = []
num_sqrt = int(math.sqrt(var_a))
for i in range(1, num_sqrt+1):
if var_a % i == 0:
list_a.append(i)
list_a.append(int(var_a/i))
list_a = sorted(set(list_a))
var_b = len(list_a)
print(int(var_b))
|
6
|
6
|
28 [OP_LIST_GET_DIVISOR] [OP_LIST_LEN]
|
var_a = 28
list_a = []
num_sqrt = int(math.sqrt(var_a))
for i in range(1, num_sqrt+1):
if var_a % i == 0:
list_a.append(i)
list_a.append(int(var_a/i))
list_a = sorted(set(list_a))
var_b = len(list_a)
print(int(var_b))
|
28 [OP_LIST_GET_DIVISOR] [OP_LIST_LEN]
|
How many divisors are there in 28?
|
28μ μ½μλ λͺ¨λ λͺ κ°μΈμ§ ꡬνμΈμ
|
Possibility
|
var_a = 2
print(int(var_a))
|
2
|
2
|
2
|
var_a = 2
print(int(var_a))
|
2
|
If you toss 10, 50, and 100-won coins, find the number of ways in which the 10-won coin will come up heads and the 100-won coin will come up tails.
|
λ°μ€ μμ μ¬κ³Όκ° 3κ°, κ°μ΄ 2κ° μμ΅λλ€. λ°μ€ μμ κ°μ λͺ κ° λ€μ΄μμ΅λκΉ?
|
Geometry
|
var_a = 0
var_b = 2000
var_c = var_a + var_b
var_d = 2
var_e = var_c * var_d
var_f = 2000
var_g = var_e + var_f
var_h = 2
var_i = var_g * var_h
print(int(var_i))
|
12000
|
12000
|
0 2000 [OP_ADD] 2 [OP_MUL] 2000 [OP_ADD] 2 [OP_MUL]
|
var_a = 0
var_b = 2000
var_c = var_a + var_b
var_d = 2
var_e = var_c * var_d
var_f = 2000
var_g = var_e + var_f
var_h = 2
var_i = var_g * var_h
print(int(var_i))
|
0 2000 [OP_ADD] 2 [OP_MUL] 2000 [OP_ADD] 2 [OP_MUL]
|
Sanghyun bought a soda at a convenience store yesterday. He drank half of the soda he bought yesterday and an additional 2000 milliliters (ml) of soda. Today, he drank half of the remaining soda and additional 2000 milliliters (ml) of soda, and there was no soda left. How many milliliters (ml) of soda did Sanghyun buy yesterday?
|
μνμ΄κ° μ΄μ νΈμμ μμ μλ£μλ₯Ό μ¬μλ€. μ΄μ μ¬μ¨ μλ£μ μ€ μ λ°κ³Ό 2000λ°λ¦¬λ¦¬ν°(γ)μ μλ£μλ₯Ό λ§μκ³ , μ€λ λ¨μ μλ£μμ μ λ°κ³Ό 2000λ°λ¦¬λ¦¬ν°(γ)λ₯Ό λ§μ
¨λλ λ¨μ μλ£μκ° μμλ€. μ΄λ μνμ΄κ° μ΄μ μ¬μ¨ μλ£μλ λͺ λ°λ¦¬λ¦¬ν°(γ)μ
λκΉ?
|
Correspondence
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.