Some of the algorithms getting started should understand something

Floor (x) returns the integer portion of x General usage for floor (x + 0.5)

sprintf means that the output to a string fprintf is output to a file,

printf ("%d", clock ()/clocks_per_sec) outputs the time at which the program runs;

IsDigit (x) determines whether x is an integer;

ASSERT.T assert (x>=0) means that the program terminates abnormally when X>=0 is not established.

When you write a recursive algorithm, remember to pay attention to the termination condition

Keyboard dislocation You can define a constant array

Cycle string Highlights word[j] = word[j%i];

Ask 1000! The exact value of f[0] = 1 for (i = 2;i < n;i++)

{

for (j = 0;j < maxn;j++)

{

int s = i * f[j] + C;

F[H] = s% 10;

c = S/10;

}

}

Some of the algorithms getting started should understand something