搜索资源列表
质数圈-c++
- 质数环,运行程序自动生成一定范围内的质数环,即相邻俩数之和为质数-prime Central, a program to run automatically generated within a certain range of standard ring, the two neighboring few and as a prime number
prime
- 素数环： 把从1到10这10个数摆成一个环，要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始，每个空位有9种可能，每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数（最后一个和第一个也要满足）。 〖算法流程〗 1、数据初始化； 2、递归填数： 判断第J种可能是否合法； A、如果合法：填数；判断是否到达目标（10个已填完）： 是，打印结果；不是，递归填下一个； B、如果不合法：选择下一种可能；-Prime Centra
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
c
- 求100以内偶数和,动态规划,动态建对象数组,素数，环路-prime，circle
prime
- Prime algorithm in visual C-Prime algorithm in visual C++
100-classic-C-algorithm-P
- 经典的C语言程序的算法代码，水仙花数，素数，排序，比较等等应有尽有，值得收藏。-The classic algorithm C language program code, daffodils number, prime number, sort, compare, and so everything worth collecting.
c-language-exercises
- c语言练习题，包括素数、取数字、完数因子、数列的四舍五入、fibonaci累加数列、以及其它的一些源代码-c language exercises, including the prime number, take number, complete the number of factors, several series of rounded, fibonaci cumulative series, as well as some other source
C.
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -Between 101-200 to determine the number of primes, and prints out all prime numbers. 1 program analysis: methods to determine the prime numbers: a numb
prime
- 图论的最小生成树问题——Prime算法的C语言实现-Graph theory, minimum spanning tree problem- Prime algorithm in C language
prime
- 输入一个数，判断这个数是否为素数的C语言代码- Enter a number to determine if the number is prime in C language code
C
- 求质数，牛顿迭代法，最大字符串，输出钻石字符串，比较字符串的大小-prime，string，diamond string
c
- C语言的一些简单经常用到的小工具程序段，比如说冒泡排序，回文数，素数分解等等。-Some of the C language simple and often use the gadget program segments, such as bubble sort, palindrome number, prime number decomposition and so on.
prime-test
- 素数测试问题（Monte Carlo算法） 求am(mod n)的算法(m≤n) 设m的二进制表示为bkbk-1…b1b0（bk=1,且k≈log2m）。 例：m=41=101001(2)，bkbk-1…b1b0=101001，（k=5）。 求am可以用下述方法：初始C←1。 -Prime number test problem ( Monte Carlo algorithm) Seek am ( MOD n ) algorithm ( M = n) A
e.c
- 1 R Finding particular sequences of prime numbers Write a program that finds all sequences of consecutive prime 5-digit numbers, say (a, b, c, d, e, f ), such that b = a + 2, c = b + 4, d = c + 6, e = d + 8, and f = e + 10.-1 R Finding particular
find-prime-numbers
- 利用C语言实现从3-1000之间找出所有的素数，算法比较简洁-Just use the most simple C language to find all the prime numbers between 3 and 1000
C-program
- 6个C语言源代码，有大小排序，素数查找，解方程，冒泡排序等-6 C language source code, size sorting, prime numbers to find, solving equations, bubble sort
C
- 如何用C语言筛选法判断质数 比如输出 2 质数 4 合数 0 0代表程序的结束，如果输入不是零，程序可以继续打入数字判断 -How to use C language such as screening method to determine prime numbers prime numbers 2, 4-output number 00 on behalf of the end of the program, if the input is not zero,
F.c
- prime finding it is realy good for finding primes that algorithm finds the primes O(n)
c-source-code
- 将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。-The prime factors of a positive integer factorization. For example: Enter 90 to print out 90 = 2* 3* 3* 5.
c-program-100-exmples
- c语言若干个经典的程序案例，包括菲比那切数列问题，鸡兔同笼问题，素数问题，闰年问题，水仙花数问题，完数问题-c language a number of cases of classic program, including Phoebe that cut the number of columns of the problem, chickens and rabbits with cage problem, prime numbers, the leap year problem, daffo