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

最新推荐文章于 2020-04-25 12:28:36 发布

goodview andyldm

最新推荐文章于 2020-04-25 12:28:36 发布

阅读量94

点赞数

分类专栏： C#编程高级练习文章标签： csharp面试题库和答案 csharp编程练习编程基础

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

版权

C#编程高级练习专栏收录该内容

236 篇文章 2 订阅

订阅专栏

k-primes中的步骤【难度:2级】:

答案1:

using System;
using System.Collections.Generic;
using System.Linq;

public static class KprimesSteps 
{
  private static long KOf(long n)
  {
    long k = 0, m = n;
    while (m % 2 == 0)
    {
      m /= 2;
      k++;
    }
    for (long i = 3; i <= Math.Sqrt(n); i += 2)
      while (m % i == 0)
      {
        m /= i;
        k++;
      }
    if (m != 1)
      k++;
    return k;
  }
  public static List<long[]> KprimesStep(int k, int step, long start, long stop)
  {
    List<long[]> result = new List<long[]>();
    for (long i = start; i <= stop - step; i++)
      if (KOf(i) == k &amp;&amp; KOf(i + step) == k)
        result.Add(new long[] {i, i + step});
    return result;
  }
}

答案2:

using System;
using System.Collections.Generic;
using System.Linq;

public class KprimesSteps 
{
    private static int countPrimeDiv(long n) 
    {
        int cnt = 0;
        for (long i = 2; i * i <= n; i++) 
        {
            while (n % i == 0) 
            {
                cnt++;
                n /= i;
            }
        }
        if (n > 1) cnt++;
        return cnt;
    }
    public static List<long[]> KprimesStep(int k, int step, long start, long nd) 
    {
        List<long[]> res = new List<long[]>();
        long i = start;
        while (i <= nd-step) 
        {
            if ((countPrimeDiv(i) == k &amp;&amp; countPrimeDiv(i+step) == k)) 
                res.Add(new long[] {i, i+step});
            i++;
        }
        return res;
    }
}

答案3:

using System;
using System.Collections.Generic;

public class KprimesSteps 
{
    public static List<long[]> KprimesStep(int k, int step, long start, long nd)
    {
        List<long[]> res = new List<long[]>();
        for (long j = start; j <= nd - step; j++)
        {
            if (IsKPrime(j, k) &amp;&amp; IsKPrime(j + step, k))
            {
                res.Add(new long[] { j, j + step });
            }
        }
        return res;
    }

    private static bool IsKPrime(long number, int k)
    {
        int numPrimes = 0;
        while (number % 2 == 0)
        {
            number /= 2;
            numPrimes++;
        }
        for (int i = 3; i * i <= number; i += 2)
        {
            while (number % i == 0)
            {
                number /= i;
                numPrimes++;
            }
        }
        if (number != 1)
        {
            numPrimes++;
        }
        return numPrimes == k;
    }
}

答案4:

using System.Collections.Generic;

public class KprimesSteps {
    public static List<long[]> KprimesStep( int k, int step, long start, long nd ) {
        var result = new List<long[]>( );
        for ( long n = start; n <= nd - step; n++ ) {
            if ( GetFactorsCount( n ) == k &amp;&amp; GetFactorsCount( n + step ) == k ) {
                result.Add( new[] {n, n + step} );
            }
        }
        return result;
    }

    private static int GetFactorsCount( long n ) {
        var result = 0;
        long factor = 2;
        while ( factor*factor <= n ) {
            while ( n%factor == 0 ) {
                result += 1;
                n /= factor;
            }
            factor += 1;
        }
        if ( n > 1 ) {
            result += 1;
        }

        return result;
    }
}

答案5:

using System;
using System.Collections.Generic;
using System.Linq;
  public class KprimesSteps
    {
        public static List<long[]> KprimesStep(int k, int step, long start, long nd)
        {
            List<long[]> res = new List<long[]>();
            long n = start;
            long end = nd;
            while(n <= nd - step)
            {
                long[] temp = pierwsze(n);
                int check = 0;
                if(temp.Length > 0) check = ileCzynnik(temp, n);
                if(check == k)
                {
                    long bis = n + step;
                    long[] tempBis = pierwsze(bis);
                    int checkBis = 0;
                    if (tempBis.Count() > 0) checkBis = ileCzynnik(tempBis, bis);
                    if (checkBis == k) res.Add(new long[] { n, bis });
                }
                n++;
            }
            return res;
        }
        
        public static long[] pierwsze(long a)
        {
            long temp = (long)Math.Sqrt(a);
            List<long> lista = new List<long>();
            while(temp > 1)
            {
                if(a % temp == 0)
                {
                    int temp2 = (int)Math.Sqrt(temp);
                    int check = 0;
                    while(temp2 > 1)
                    {
                        if(temp % temp2 == 0)
                        {
                            check = 1;
                            temp2 = 1;
                        }
                        temp2--;
                    }
                    if (check == 0) lista.Add(temp);

                    long temp2Bis = a / temp;
                    if(temp2Bis != temp)
                    {
                        int temp2BisSqr = (int)Math.Sqrt(temp2Bis);
                        check = 0;
                        while (temp2BisSqr > 1)
                        {
                            if (temp2Bis % temp2BisSqr == 0)
                            {
                                check = 1;
                                temp2BisSqr = 1;
                            }
                            temp2BisSqr--;
                        }
                        if (check == 0) lista.Add(temp2Bis);
                    }
                }
                temp--;
            }
            return lista.ToArray();
        }

        private static int ileCzynnik(long[] a, long n)
        {
            a = a.OrderByDescending(x => x).ToArray();
            int i = 0;
            int res = 0;
            while(n != 1)
            {
               while(n % a[i] == 0)
                {
                    n /= a[i];
                    res++;
                }
                i++;
            }
            return res;
        }
    }

答案6:

using System;
using System.Collections.Generic;
using System.Linq;

public class KprimesSteps 
{
    public static List<long[]> KprimesStep(int k, int step, long start, long nd) 
    {
        List<long[]> res = new List<long[]>();
         for (long i = start; i <= nd - step; i++) {        
          if (FindK(i, k) &amp;&amp; FindK(i + step, k)) {
            res.Add(new long[] {i, i + step});
          }
        }
        return res;
    }
    private static bool FindK(long n, int k) {
    var count = 0;   
    for (var i = 2; i * i <= n; i++)
    {
      while (n % i == 0) {
        count++;
        if (count > k) {
          return false;
        }
        n /= i;
      }
    }
    if (n > 1) {
      count++;
    }
    return count == k;
  }
    
}

答案7:

using System;
using System.Collections.Generic;
using System.Linq;

public class KprimesSteps 
{
   public static List<long[]> KprimesStep(int k, int step, long start, long nd)
        {
            List<long> longSortList = new List<long>();
            List<long[]> result = new List<long[]>();
            
            for (int i = (int)start; i <= nd; i++)
            {
                int count = 0;
                int mynumber = (int)i;
                int increment = 2;
                
                while (mynumber > 1)
                {
                    if (mynumber % increment == 0)
                    {                   
                        count++;
                        mynumber /= increment;
                    }
                    else
                    {
                        increment++;
                    }
                 }
                 if (count == k)
                 {
                     longSortList.Add(i);
                 }
                 
             }
              for (int j = 0; j < longSortList.Count - 1; j++)
                {
                
                    if(longSortList.Contains(longSortList[j] + step))
                      {
                        long one = longSortList[j];
                        long[] array = {one, (one + step)};
                        result.Add(array);
                      }          
                }
                
            return result;

        }
}

答案8:

using System;
using System.Collections.Generic;
using System.Linq;

public class KprimesSteps 
{
    public static List<long[]> KprimesStep(int k, int step, long start, long nd) 
    {
      List<long> plist = new List<long>();
      for (long n = start; n <= nd; n++) {
        if (PrimesCount(n) == k) {
        plist.Add(n);
        }
      }
      
      List<long[]> rlist = new List<long[]>();
      for (int i = 0; i < plist.Count - 1; i++) {
          if (plist.Contains(plist[i] + step)) {
              rlist.Add(new long[] { plist[i], plist[i] + step });
          }
      }
      return rlist;
    }
    
    public static int PrimesCount(long x) {
        int count = 0;
        while (x % 2 == 0) {
            count++;
            x /= 2;
        }
        for (long j = 3; j <= Math.Sqrt(x); j += 2) {
            while (x % j == 0) {
                count++;
                x /= j;
            }
        }
        if (x > 2) count++;

        return count;
    }
}

答案9:

using System;
using System.Collections.Generic;
using System.Linq;

public class KprimesSteps 
{
        public static List<long[]> KprimesStep(int k, int step, long start, long nd)
        {
            var list = new List<long>();
            for (var i = start; i <= nd; i++)
            {
                var num = i;
                var count = 0;
                while (num % 2 == 0)
                {
                    count++;
                    num /= 2;
                }
                for (long j = 3; j <= Math.Sqrt(num); j += 2)
                {
                    while (num % j == 0)
                    {
                        count++;
                        num /= j;
                    }
                }
                if (num > 2) count++;
                if (count == k) list.Add(i);
            }
            var result = new List<long[]>();
            for (int i = 1; i < list.Count; i++)
            {
                for (int j = i-1; j >= 0; j--)
                {
                    if (list[i] - list[j] == step) result.Add(new[] {list[j], list[i]});
                    if (list[i] - list[j] > step) break;
                }
            }
            return result;
        }
}

goodview andyldm

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
C#练习题答案: k-primes中的步骤【难度：2级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

k-primes中的步骤【难度:2级】:答案1:using System;using System.Collections.Generic;using System.Linq;public static class KprimesSteps { private static long KOf(long n) { long k = 0, m = n; while...
复制链接

扫一扫