chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md

@@ -1,22 +1,24 @@
 ---
 id: 5900f43e1000cf542c50ff4f
-title: 问题209：循环逻辑
+title: 'Problem 209: Circular Logic'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301850
 dashedName: problem-209-circular-logic
 ---
 
 # --description--
 
-k输入二进制真值表是从k个输入位（二进制数字，0 \[假]或1 \[真]）到1个输出位的映射。例如，逻辑AND和XOR函数的2输入二进制真值表是：
+A k-input binary truth table is a map from k input bits
 
-x y x AND y000010100111x y x XOR y000011101110多个6输入二进制真值表τ满足公式
+(binary digits, 0 \[false] or 1 \[true]) to 1 output bit. For example, the 2-input binary truth tables for the logical AND and XOR functions are:
 
-所有6位输入（a，b，c，τ，a，b，c，d，e，f）和τ（b，c，d，e，f，一个XOR（b和c））= 0 d，e，f）？
+x y x AND y000010100111x y x XOR y000011101110How many 6-input binary truth tables, τ, satisfy the formula
+
+τ(a, b, c, d, e, f) AND τ(b, c, d, e, f, a XOR (b AND c)) = 0 for all 6-bit inputs (a, b, c, d, e, f)?
 
 # --hints--
 
-`euler209()`应该返回15964587728784。
+`euler209()` should return 15964587728784.
 
 ```js
 assert.strictEqual(euler209(), 15964587728784);