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
Search found 4 matches
- Thu May 15, 2008 6:41 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10081 - Tight Words
- Replies: 16
- Views: 6622
- Mon Jun 13, 2005 9:35 pm
- Forum: C
- Topic: quicksort built in
- Replies: 8
- Views: 8682
Re: quicksort built in
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(td...
- Mon May 23, 2005 6:43 pm
- Forum: C
- Topic: men.h or memory.h
- Replies: 3
- Views: 2564
men.h or memory.h
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?...
- Fri May 20, 2005 5:21 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10196 - Check The Check
- Replies: 77
- Views: 25541