送交者: Enlighten 于 2008-04-30, 10:30:51:

• if you just count the result, the only solution is - xj (65 bytes) 2008-04-30, 10:48:54 (222501)
  • that is the same as 2^N (无内容) - Enlighten (0 bytes) 2008-04-30, 10:52:25 (222504)
• Wrong, you overcounted. - james_hussein_bond (178 bytes) 2008-04-30, 10:41:50 (222497)
  • 2 booleans should be 8 combinations if NOT is allowed (无内容) - Enlighten (0 bytes) 2008-04-30, 10:44:47 (222498)
    • Change the question to fit the answer? :-) (无内容) - james_hussein_bond (0 bytes) 2008-04-30, 10:46:43 (222500)
      • the question wasnt well defined. now it is. big deal. (无内容) - Enlighten (0 bytes) 2008-04-30, 10:49:34 (222502)
        • You're still wrong. if NOT is allowed, there are at least 12 for 2 - james_hussein_bond (161 bytes) 2008-04-30, 10:54:38 (222507)
          • forgot one constraint: A+B+C=full set (无内容) - Enlighten (0 bytes) 2008-04-30, 10:57:07 (222510)
            • What is a "full set"? Can you give a definition? (无内容) - james_hussein_bond (0 bytes) 2008-04-30, 11:04:32 (222515)
    • might need to minus 1 from the solution, nonetheless - Enlighten (16 bytes) 2008-04-30, 10:46:16 (222499)
• 这里尽是连算术和数论都搞不清，你在这里扎什么台型？Too simple, too naiive (无内容) - 老中一一号 (0 bytes) 2008-04-30, 10:37:51 (222494)
• 有没有更ELEGANT的解法？ (无内容) - Enlighten (0 bytes) 2008-04-30, 10:33:17 (222493)

加跟贴