freeCodeCamp/problem-209-circular-logic.chinese.md at a34919091122b51c764857deae22f13e4be9c06e

Files

Beau Carnes 2ca3a2093f Add languages Russian, Arabic, Chinese, Portuguese (#18305 )

2018-10-11 03:33:03 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f43e1000cf542c50ff4f	5	Problem 209: Circular Logic		问题209：循环逻辑

Description

k输入二进制真值表是从k个输入位（二进制数字，0 [假]或1 [真]）到1个输出位的映射。例如，逻辑AND和XOR函数的2输入二进制真值表是：

x y x AND y000010100111x y x XOR y000011101110多个6输入二进制真值表τ满足公式

所有6位输入（a，b，c，τ，a，b，c，d，e，f）和τ（b，c，d，e，f，一个XOR（b和c））= 0 d，e，f）？

Instructions

Tests

tests:
  - text: <code>euler209()</code>应该返回15964587728784。
    testString: 'assert.strictEqual(euler209(), 15964587728784, "<code>euler209()</code> should return 15964587728784.");'

Challenge Seed

function euler209() {
  // Good luck!
  return true;
}

euler209();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape