Advertisement
Guest User

Untitled

a guest
Dec 20th, 2014
194
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.96 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #define Length 100
  4.  
  5. char *names[100] = {
  6. "Jacob",
  7. "Mason",
  8. "William",
  9. "Jayden",
  10. "Noah",
  11. "Michael",
  12. "Ethan",
  13. "Alexander",
  14. "Aiden",
  15. "Daniel",
  16. "Anthony",
  17. "Matthew",
  18. "Elijah",
  19. "Joshua",
  20. "Liam",
  21. "Andrew",
  22. "James",
  23. "David",
  24. "Benjamin",
  25. "Logan",
  26. "Christopher",
  27. "Joseph",
  28. "Jackson",
  29. "Gabriel",
  30. "Ryan",
  31. "Samuel",
  32. "John",
  33. "Nathan",
  34. "Lucas",
  35. "Christian",
  36. "Jonathan",
  37. "Caleb",
  38. "Dylan",
  39. "Landon",
  40. "Isaac",
  41. "Gavin",
  42. "Brayden",
  43. "Tyler",
  44. "Luke",
  45. "Evan",
  46. "Carter",
  47. "Nicholas",
  48. "Isaiah",
  49. "Owen",
  50. "Jack",
  51. "Jordan",
  52. "Brandon",
  53. "Wyatt",
  54. "Julian",
  55. "Aaron",
  56. "Sophia",
  57. "Isabella",
  58. "Emma",
  59. "Olivia",
  60. "Ava",
  61. "Emily",
  62. "Abigail",
  63. "Madison",
  64. "Mia",
  65. "Chloe",
  66. "Elizabeth",
  67. "Ella",
  68. "Addison",
  69. "Natalie",
  70. "Lily",
  71. "Grace",
  72. "Samantha",
  73. "Avery",
  74. "Sofia",
  75. "Aubrey",
  76. "Brooklyn",
  77. "Lillian",
  78. "Victoria",
  79. "Evelyn",
  80. "Hannah",
  81. "Alexis",
  82. "Charlotte",
  83. "Zoey",
  84. "Leah",
  85. "Amelia",
  86. "Zoe",
  87. "Hailey",
  88. "Layla",
  89. "Gabriella",
  90. "Nevaeh",
  91. "Kaylee",
  92. "Alyssa",
  93. "Anna",
  94. "Sarah",
  95. "Allison",
  96. "Savannah",
  97. "Ashley",
  98. "Audrey",
  99. "Taylor",
  100. "Brianna",
  101. "Aaliyah",
  102. "Riley",
  103. "Camila",
  104. "Khloe",
  105. "Claire"
  106. };
  107. typedef struct node{
  108. char data[100];
  109. struct node *link;
  110. }node;
  111.  
  112. node* create (){
  113. node* new_ptr =(node*)malloc(sizeof(node));
  114. strcpy(new_ptr->data,"");
  115. new_ptr->link=NULL;
  116. return new_ptr;
  117. }
  118.  
  119. void add(node *root,char* name){
  120. node* new_ptr =(node*)malloc(sizeof(node));
  121. if(new_ptr != NULL){
  122. while(root -> link != NULL){
  123. root = root -> link;}
  124. new_ptr -> link = NULL;
  125. strcpy(new_ptr->data,name);;
  126. root -> link = new_ptr;
  127. }
  128. }
  129.  
  130. main(){
  131. node *Hash[Length];
  132. int x;
  133. for(x=0;x<Length;x++){
  134. Hash[x]=create();
  135. }
  136. int j=0;
  137. double time=0;
  138. for(;j!=100;j++){
  139. int sum=0;
  140. int i=0;
  141. for(; i<strlen(names[j]);i++){
  142. sum +=*(names[j]+i);
  143. }
  144. sum %=Length;
  145. while(1){
  146. if(strcmp(Hash[sum%Length]->data,"") == 0){
  147. strcpy(Hash[sum%Length]->data,names[j]);
  148. break;
  149. }else {
  150. add(Hash[sum%Length],names[j]);
  151. break;
  152. }
  153. }
  154. }
  155. int temp=1;
  156. for(j=0;j<Length;){
  157. printf("%d %s\n",j,Hash[j]->data);
  158. if(Hash[j]->link !=NULL){
  159. temp++;
  160. Hash[j]=Hash[j]->link;
  161. }else{
  162. time+=(temp+1)*temp/2;
  163. j++;
  164. temp=1;
  165. }
  166. }
  167. printf("%f",time/100);
  168. return 0;
  169. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement