C#练习题答案: 在素数的步骤【难度：2级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

在素数的步骤【难度:2级】:

答案1:

using System;
class StepInPrimes 
{
    public static long[] Step(int g, long m, long n)
        {
            for (long i = m; i <= n; i++)
            {
                if (isPrime(i))
                {
                    if (isPrime(i + g) &amp;&amp; (i + g) <= n)
                    {
                        return new long[2] { i, i + g };
                    }
                }
            }
            return null;
        }

        public static bool isPrime(long number)
        {
            if (number == 1) return false;
            if (number == 2) return true;

            if (number % 2 == 0) return false; //Even number     

            for (int i = 3; i <= Math.Ceiling(Math.Sqrt(number)); i += 2)
            {
                if (number % i == 0) return false;
            }
            return true;
        }        
}​

答案2:

using System.Collections.Generic;

class StepInPrimes 
{
    public static long[] Step(int g, long m, long n) 
    {
        var primes = new List<long>();
        bool[] composite = new bool[n + 1];
        for (long i = 2; i * i <= n; i++)
            if (!composite[i])
                for (long j = i * i; j <= n; j += i)
                    composite[j] = true;
        for (long i = m; i <= n; i++)
            if (!composite[i] &amp;&amp; i >= m)
                primes.Add(i);
        int prev;
        for (int i = 0; i < primes.Count; i++)
            if ((prev = primes.IndexOf(primes[i] - g)) != -1)
                return new long[] { primes[prev], primes[i]};
        return null;
    }        
}​

答案3:

class StepInPrimes 
{
        public static long[] Step(int g, long m, long n)
        {
            var s = new bool[n + 1];
            for (long i = 2; i < s.Length; i++)
            {
                if (!s[i])
                {
                    if (i - g >= m &amp;&amp; !s[i - g]) return new[] { i - g, i };
                    for (long j = i * i; j < s.Length; j += i)
                        s[j] = true;
                }
            }

            return null;
        }
}​

答案4:

using System;

public static class StepInPrimes 
{
  public static long[] Step(int g, long m, long n)
  {
    for (long i = m; i <= n - g; i++)
      if (IsPrime(i) &amp;&amp; IsPrime(i + g))
        return new long[] {i, i + g};
    return null;
  }
  private static bool IsPrime(long n)
  {
    if (n <= 2 || n % 2 == 0)
      return n == 2;
    for (long i = 3; i <= Math.Sqrt(n); i += 2)
      if (n % i == 0)
        return false;
    return true;
  }
}​

答案5:

using System;
class StepInPrimes 
{
    public static long[] Step(int g, long m, long n) 
    {
        // your code 
        if (g < 1 || m >= n) return null;

        for (long i = m; m <= n; i++)
        {
            if (!IsPrimes(i))
            {
                continue;
            }
            long end = i + g;
            if(end > n) return null;
            if (IsPrimes(end))
            {
                return new long[] {i, end};
            }
            i ++;
        }
        return null;
    }      
    
        public static bool IsPrimes(long number)
        {
            if (number == 2) return true;
            if (number < 2 || number % 2 == 0) return false;
            
            int pos =(int)Math.Ceiling(Math.Sqrt(number));
            for (int i = 3; i <= pos; i += 2)
            {
                if (number % i == 0) return false;
            }
            return true;
        }

}​

答案6:

using System;

public class StepInPrimes
{
    static bool[] GetPrimes(long n)
    {
        bool[] numbers = new bool[n + 1];
        numbers[0] = true;
        numbers[1] = true;
        long sqrtOfN = (long)Math.Round(Math.Sqrt(n));
        for (long i = 2; i <= sqrtOfN; i++)
        {
            if (numbers[i])
                continue;
            for (long j = i * i; j <= n; j += i)
                numbers[j] = true;
        }
        return numbers;
    }
    public static long[] Step(int g, long m, long n)
    {
        bool[] primes = GetPrimes(n);
        n = n - g;
        for (long i = m; i <= n; i++)
            if (primes[i] == false &amp;&amp; primes[i + g] == false)
                return new long[] { i, i + g };
        return null;
    }
}​

答案7:

using System;
class StepInPrimes {
    public static bool IsP(long n){
      for (long i=3;i<=Math.Sqrt(n);i+=2) if (n%i==0) return false;
      return n<2|n%2==0 ? false : true;
    }
    public static long[] Step(int g, long m, long n) {
      for (long i=m/2*2+1;i<=n-g;i+=2)  if (IsP(i)&amp;&amp;IsP(i+g)) return new long[]{i,i+g};
      return null;
    }        
}​

答案8:

using System;

class StepInPrimes 
{
    private static Boolean Prime(long n) 
    {
        if (n == 2) return true;
        else if ((n < 2) || (n % 2 == 0)) return false;
        else {
            for (long i = 3; i <= Math.Sqrt(n); ++i) {
                if (n % i == 0) return false;
            }
            return true;
        }
    }
    public static long[] Step(int g, long m, long n) 
    {
        long[] res = new long[2];
        long i = m;
        while (i <= n - g) {
            if (Prime(i) &amp;&amp; Prime(i + g)) {
                res[0] = i;
                res[1] = i + g;
                return res;
            }
            i++;
        }
        return null;
    }   
}​

答案9:

class StepInPrimes 
{
    private static bool isPrime(long x)
    {
      for (long c = 2; (c * c) <= x; c++)
      {
        if (isPrime(c) &amp;&amp; ((x % c) == 0))
        {
          return false;
        }
      }
      return true;
    }
    
    public static long[] Step(int g, long m, long n) 
    {
      for (long x = m; x < (n-g); x++)
      {
        if (isPrime(x) &amp;&amp; isPrime(x+g))
        {
          return new long[] {x, x+g};
        }
      }
      return null;
    }    
}​

答案10:

    using System;
    using System.Collections.Generic;
    using System.Linq;
    class StepInPrimes
    {
        public static long[] Step(int g, long m, long n)
        {
            while (m <= n - g)
            {
                if (IsPrime(m) &amp;&amp; IsPrime(m + g))
                    return new[] {m, m + g};
                m++;
            }
            return null;
        }
        public static bool IsPrime(long n)
        {
            for (var i = 2; i <= Math.Ceiling(Math.Sqrt(n)); i++)
                if (n%i == 0)
                    return false;
            return true;
        }
    }​