OJ Board

for k=9 and n=100
the number of tight words:
tights = 100512267936480837475180750161082113997249340218
And the number of possible words:
possibles = (k+1)^n = 10^100
Then
% = 100.0*(tights/possibles)
% = 0.00000

Hi titid_gede.

in the book "PROGRAMMING CHALLENGES" of "Steven S. Skiena And Miguel A. Revilla"
exist an example in page 86 of how using the qsort.
And in your example:

// declare directly with the structure "tdata *" and not with "const void *"
int Compare(tdata *A, tdata*B)
{
if(A->key == B ...

Hello friends,
I am a beginner in this fantastic world and therefore I have many questions, two of them are:
- I can use the library "mem.h or memory.h", in particular the function "memset()" ?
- Where I can find the codes in C, C++ and PASCAL from the solutions to some problems?

PD:
Thank you ...

Yes friend. Cut the "Uses Crt" and "clrscr"