Advertisement
Guest User

Untitled

a guest
Jul 25th, 2017
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.41 KB | None | 0 0
  1.  
  2. //
  3. // Переставленные таблицы и соответствующие матрицы:
  4. //
  5.  
  6. for (int i = 0; i < modules->mod_count; ++i) {
  7. printf("Module %d:\n", modules->mods[i]);
  8. size_t matrix_size = modules->mods[i];
  9.  
  10. printf("Addition table:\n");
  11. for (int j = 0; j < matrix_size; ++j) {
  12. for (int l = 0; l < j; ++l)
  13. printf(" ");
  14. for (int k = 0; k < matrix_size - j; ++k)
  15. printf("%3d ", sums[i][j*matrix_size+k]);
  16. printf("\n");
  17. }
  18. printf("\n");
  19.  
  20. printf("Multiplication table:\n");
  21. for (int j = 0; j < matrix_size; ++j) {
  22. for (int l = 0; l < j; ++l)
  23. printf(" ");
  24. for (int k = 0; k < matrix_size - j; ++k)
  25. printf("%3d ", mults[i][j*matrix_size+k]);
  26. printf("\n");
  27. }
  28. printf("\n");
  29.  
  30. printf("Rearranged table:\n");
  31. for (int j = 0; j < SIZE_MATRIX; ++j) {
  32. for (int l = 0; l < j; ++l)
  33. printf(" ");
  34. for (int k = 0; k < SIZE_MATRIX - j; ++k)
  35. printf("%3d ", wows[i][j*matrix_size+k]);
  36. printf("\n");
  37. }
  38. printf("\n");
  39.  
  40. printf("\n");
  41. }
  42.  
  43. //
  44. // Таблица Хаффмана
  45. //
  46. printf("Huffman:\n");
  47. for (int i = 0; i < max_module; ++i) {
  48. printf("%d | %s\n",i, enc.huffman_codes[i]);
  49. }
  50. printf("\n");
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement