bselect.c 1.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. static unsigned char *ptr[100];
  4. static int ptrc;
  5. #define M 256
  6. static struct
  7. {
  8. int pos;
  9. int cnt;
  10. } max[M];
  11. static int active[100];
  12. static int activec;
  13. static int active_pos;
  14. static void
  15. fill_max(void)
  16. {
  17. int i, n, b, c, u;
  18. memset(max, 0, sizeof(max));
  19. for (b = 0; b < 0x800; b++)
  20. {
  21. c = 0;
  22. for (i = 0; i < activec; i++)
  23. {
  24. for (u = i + 1; u < activec; u++)
  25. {
  26. if (ptr[active[i]][b] == ptr[active[u]][b])
  27. {
  28. goto bad;
  29. }
  30. }
  31. c ++;
  32. bad:;
  33. }
  34. for (i = 0; i < M; i ++)
  35. {
  36. if (max[i].cnt < c)
  37. {
  38. max[i].pos = b;
  39. max[i].cnt = c;
  40. break;
  41. }
  42. }
  43. }
  44. }
  45. static void
  46. select_max(void)
  47. {
  48. int i, m, c;
  49. m = max[0].cnt;
  50. if (max[0].cnt == 1)
  51. {
  52. printf("no solution!\n");
  53. exit(1);
  54. }
  55. c = 0;
  56. for (i = 0; i < M; i++)
  57. {
  58. if (m == max[i].cnt)
  59. {
  60. c++;
  61. }
  62. }
  63. i = random() % c;
  64. active_pos = max[i].pos;
  65. printf("0x%03X (%d) ", active_pos, max[i].cnt);
  66. }
  67. static void
  68. search_active(void)
  69. {
  70. int i, j, a;
  71. int tmpa[100];
  72. a = 0;
  73. for (i = 0; i < activec; i++)
  74. {
  75. for (j = 0; j < activec; j++)
  76. {
  77. if (i == j)
  78. {
  79. continue;
  80. }
  81. if (ptr[active[i]][active_pos] ==
  82. ptr[active[j]][active_pos])
  83. {
  84. tmpa[a] = active[i];
  85. a++;
  86. break;
  87. }
  88. }
  89. }
  90. printf("(%d) ", a);
  91. for (i = 0; i < activec; i++)
  92. {
  93. printf("%02X ", ptr[active[i]][active_pos]);
  94. }
  95. printf("\n");
  96. memcpy(active, tmpa, sizeof(active));
  97. activec = a;
  98. }
  99. int
  100. main(int argc, char *argv[])
  101. {
  102. int i, u, b, c;
  103. FILE *f;
  104. srandom(time(NULL));
  105. ptrc = argc - 1;
  106. /*
  107. * read data
  108. */
  109. for (i = 0; i < ptrc; i++)
  110. {
  111. ptr[i] = malloc(0x800);
  112. f = fopen(argv[i + 1], "rb");
  113. fread(ptr[i], 1, 0x800, f);
  114. fclose(f);
  115. active[i] = i;
  116. }
  117. activec = ptrc;
  118. while (activec > 0)
  119. {
  120. fill_max();
  121. select_max();
  122. search_active();
  123. }
  124. return 0;
  125. }