how to find soundex number

Cycle-23. Find out (20) time limit MS Memory limit 65536 KB code length limit 8000 B award Program StandardAuthor Chen Jianhai (Zhejiang University) source ZojThe so-called completion of the number is exactly equal to the sum of factors other than itself. For example: 6=1+2+3, where 1, 2, and 3 are 6 factors. The subject asks to write a program that finds all the ends of any two positive integers m and N.In

mod n, you need to add N to the result. Let us first understand how to use the congruence theorem to find the remainder:/* For example 10000 to M redundancy: * 10000%m* = = (10%m*1000%m)%m* = = (10%m* (10%m*100%m)%m)%m * = = (10%m* (10%m* (10%m*10%m)%m)%m)%m* The code is: * Assuming that 10000 is the length of the string is Len *//** such as 123 to M for redundancy * 123%m * = ((12%m*10%m)%m+3%m)%m * = = (((10%m+2%m)%m*10%m)%m+3%m)%m * = (((1% m*10%

Recursive exercises give any floating point number, and find the smallest integer that converts the fractional part into an integer. /*************************************** **************************************** ** Copyright (C ), 1988-1999, drvivermonkey. co ., ltd. file name: Author: Driver Monkey Version: Mail: bookworepeng@hotmail.com qq: 196568501 Date: 2014.04.02 Description: recursive exercise giv

C ++ uses a UDF to find the second largest number in an integer array. This example describes how C ++ uses a UDF to find the second largest number in an integer array. Share it with you for your reference. The specific implementation method is as follows: ? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

Yesterday, colleagues had a need to know the month of the first sale of each item, and the month of the last sale. I want to use what Excel function to solve, but found a half-day did not find the right, and finally through the VBA to solve it.How to use:Excel Tools-Macro-visual Basic Editor right-click in the left column,Insert-ModuleThen enter:1 FunctionLast0 (ByValInt_row as Integer) as Integer2Last0 = -3 Do whileCells (Int_row, Last0) ="" a

I. Source and description of the problemToday saw July's microblog, found the July problem, there is this problem, very interesting.The size of any two adjacent elements in array a differs by 1, and is given the array A and target integer t to find the position of T in array A. Arrays: [1,2,3,4,3,4,5,6,5], locate 4 in the array.two. Algorithm analysis and implementationthe worst time complexity of the topic is also O (N) (increment or decrement), so t

#include #include void Main () {int a[5],i,*p;int x=10;Srand (Time ());printf ("Input data to array:\n");for (i=0;iA[i]=rand ()%100;printf ("%-4d", A[i]);}printf ("\ n");P=null;for (i=0;iif (a[i]==x) {p=a[i];}}if (p!=null) {printf ("The%d address is%x\n", x,p);}else{printf ("The%d not in array\n", X);}printf ("\ n");}Note: If the pointer does not let it be equal to NULL, it will always point to an address. So let it be null first, if we find the addre

This article describes the C language to achieve the two descending sequence to find a certain number of methods to share for everyone to use for reference. The specific methods are as follows: In general, this problem is a very difficult question in the binary search method. The topics are as follows: An array is left by a descending sequence of several bits to form, such as {4, 3, 2, 1, 6, 5} is moved

Find out if any two numbers in the array are added equal to a K value (assuming that there are two numbers in the array), which is an algorithm question previously asked on 36 Krypton two sides. Idea 1: Exhaustive method, two-tier for loop Idea 2: You can use the hash table to store the elements in the array, so we get a number, to judge that Sum-val is not in the array, if in the array, then found a pair

1. Any number of arguments to the PHP function You probably know that PHP allows you to define a default parameter for a function. But you may not know that PHP also allows you to define a function that is completely arbitrary.The following is an example of a function that shows you the default parameters: Two default parameters function foo ($arg 1 = ', $arg 2 = ') {echo "arg1: $arg 1\n"; echo "arg2: $arg 2\n";} Foo (' Hello ', ' world ');/* Output:

! GEQ 1024Set/a "s2=!s1!>>10" SetD=KBif!s2! GEQ 1024Set/a "s3=!s2!>>10" SetD=KBEchoIn the "%dirpath%" root directory there is%%i%%j, the total size is:!s3! GB =!s2! MB =!s1!! D! )PauseThe program also does not explain much, we can see at a glance, just put other people's things together, call method:One: Double click to execute, follow the prompts to enter the folder path you need to build.Two: Start-run--cmd, and then find where the bat file is st

Pick Formula: The area of a simple polygon with a lattice point on a plane = the number of points on the edge/2+ the number of points inside +1.The code is as follows:--------------------------------------------------------------------------------------------------------------- -------------#include #includestring.h>#include#include#includeusing namespacestd;Const intMAXN = -;Const DoubleEPS = 1e-Ten;struct

1. Print the prime number between 100~2002. Output multiplication table3. Judging the leap year between 1000---2000#include #include #include int main (){int count = 0;int div = 0;printf ("prime number between output 100-200 \ n");for (int prime = 101; prime{for (div= 2; div{count++;if (Prime%div = = 0)Break}if (Div >sqrt (prime))printf ("%d\n", Prime);}System ("pause");return 0;}#include #include int main

1 usingSystem;2 usingSystem.Collections.Generic;3 usingSystem.Linq;4 usingSystem.Text;5 6 namespaceConsoleApplication17 {8 classClass19 {Ten Static voidaaastring[] args) One { A intA, B, C,d,max; -Console.Write ("Please enter three number:"); - stringA1 =console.readline (); the stringB1 =console.readline (); - stringC1 =console.readline (); - -A =Convert.ToInt32 (A1); +b =Conver

classProgram {//To understand recursion, first understand recursion. (It's just a joke)//recursion, as the name implies, is handed to return, so repeatedly, until a certain condition is not met. and function recursive means function call function itself. Here's an example with code: Public intJiecheng (intN) {//Use this function to implement factorial, n to indicate the number of factorial if(N 1) return 1; ElseN= N

Multiply hash:This kind of hash function takes advantage of the non-correlation of multiplicationint Hash (char *str){int seed = 131, value=0;while (*str! = ')} {Value = value*seed+ (*str++);}Return value0x7fffffff;}The multiplier used here is 131, and the recommended multiplier is 1313, 13131, 131313, etc.In addition to multiplying by a fixed number, the common ones are multiplied by a constantly changing number