120

SUBMITTED BY: Guest

DATE: Dec. 25, 2013, 3:05 p.m.

FORMAT: Text only

SIZE: 1.5 kB

Raw Download

HITS: 2110

Report
  1. #include <cstdio>
  2. #include <cstdlib>
  4. int stack[30];
  5. int stackCnt;
  6. int sorted[30];
  8. int compare (const void * a, const void * b)
  9. {
  10. return ( *(int*)a - *(int*)b );
  11. }
  13. void flip(int place)
  14. {
  15. int tmp;
  17. for (int i = 0; i <= place/2; ++i)
  18. {
  19. tmp = stack[i];
  20. stack[i] = stack[place-i];
  21. stack[place-i] = tmp;
  22. }
  23. }
  25. int main()
  26. {
  27. int pancake;
  28. char c;
  30. while (true)
  31. {
  32. stackCnt = 0;
  33. c = 0;
  35. while (scanf("%d%c", &pancake, &c) == 2 && c != '\n')
  36. {
  37. stack[stackCnt++] = pancake;
  38. printf("%d ", pancake);
  39. }
  40. if (c == '\n')
  41. {
  42. stack[stackCnt++] = pancake;
  43. printf("%d\n", pancake);
  44. }
  45. else
  46. break;
  47. // copy stack
  48. for (int i = 0; i < stackCnt; ++i)
  49. sorted[i] = stack[i];
  51. qsort(sorted, stackCnt, sizeof(int), compare);
  53. // najit umisteni aktualne nejvetsi palacinky
  54. // 1. pokud je vespod pokracuj
  55. // 2. pokud je na vrchu, prehod ji na misto
  56. // 3. jinak ji prehod na vrsek a pokracuj bodem 2
  58. for (int i = stackCnt - 1; i; --i)
  59. {
  60. if (sorted[i] == stack[i])
  61. continue;
  62. else if (sorted[i] == stack[0])
  63. {
  64. printf("%d ", stackCnt - i);
  65. flip(i);
  66. }
  67. else
  68. {
  69. int j;
  70. for (j = 0; stack[j] != sorted[i]; ++j);
  71. printf("%d ", stackCnt - j);
  72. flip(j);
  73. ++i;
  74. }
  75. }
  76. printf("0\n");
  77. }
  78. return 0;
  79. }
comments powered by Disqus