C#练习题答案: 简单有趣＃119：子集奇偶【难度：4级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

本文链接：https://blog.csdn.net/weixin_45444821/article/details/103231991

简单有趣#119:子集奇偶【难度:4级】:

答案1:

namespace myjinxin
{
    using System;
    using System.Numerics;
    public class Kata
    {
        public static BigInteger factorial(int n) { return n == 0 ? 1 : BigInteger.Multiply(n,factorial(n-1));}
        public string SubsetsParity(int n, int k){
          return (""+n).Length > 5 || BigInteger.Divide(factorial(n), BigInteger.Multiply(factorial(k),factorial(n - k))) % 2 == 0 ?
          "EVEN" : "ODD";
        }
    }
}

答案2:

namespace myjinxin {
  using System;
  public class Kata {
    public string SubsetsParity(int n, int k) {
        string N = Convert.ToString(Convert.ToInt32(n), 2);
        string K = Convert.ToString(Convert.ToInt32(k), 2);
        int Ns = N.Length, Ks = K.Length, max = Ns > Ks ? Ks : Ns;
        for (int i = 0; i < max; i++)
          if (N[Ns - i - 1] == '0' &amp;&amp; K[Ks - i - 1] == '1')
            return "EVEN";
        return "ODD";
    }
  }
}

答案3:

namespace myjinxin
{
    using System;
    
    public class Kata
    {
        public string SubsetsParity(int n, int k){
          if (((n - k) &amp; k) > 0)
            return "EVEN";
          else
            return "ODD";
        }
    }
}

答案4:

namespace myjinxin {
  using System;
    
  public class Kata {
    private uint CountOnes(int n) {
      uint count;
      for (count = 0; n != 0; count++)
        n &amp;= n - 1;
      return count;
    }
  
    public string SubsetsParity(int n, int k)
      => CountOnes(n) - CountOnes(k) - CountOnes(n - k) == 0 ? "ODD" : "EVEN";
  }
}

答案5:

using System;

namespace myjinxin
{
    public class Kata
    {
        public string SubsetsParity(int n, int k) => (n &amp; k) == k ? "ODD" : "EVEN";
    }
}

答案6:

namespace myjinxin
{
    using System;
    
    public class Kata
    {
        static int Get2(int number)
        {   
            if (number <= 1) return 0;         
            var pow = (int)Math.Log(number, 2);
            var result = (int)Math.Pow(2, pow) - 1;
            result += Get2(number - (int)Math.Pow(2, pow));
            return result;            
        }
        
        public string SubsetsParity(int n, int m)
        {
            if (Get2(n) > (Get2(n-m) + Get2(m)))
                return "EVEN";            
            return "ODD";
        }
    }
}

答案7:

using System.Numerics;

namespace myjinxin

{
    using System;
    
    public class Kata
    {
        
        public string SubsetsParity(int n, int k){
          if (n==k) {return "ODD";}
          else {
            for (int i = 0; i < 32; i++)
                {
                  if ((k &amp; (1 << i)) != 0 &amp;&amp; ((n-k) &amp; (1 << i)) != 0) {return "EVEN";}
                }
            }
            return "ODD";
          }
    }
}

答案8:

namespace myjinxin
{
    public class Kata
    {
        public string SubsetsParity(int n, int k) => ((n-k) &amp;k) > 0 ? "EVEN" :"ODD";
    }
}

答案9:

namespace myjinxin
{
  using System;
  
  public class Kata
  {
    public string SubsetsParity(int n, int k)
    {
      while (n > 0)
      {
          if (n % 2 < k % 2)
              return "EVEN";
          n /= 2;
          k /= 2;
      }
      return "ODD";
    }
  }
}