1. Pascal / Говнокод #15819

    +91

    1. 01
    2. 02
    3. 03
    4. 04
    5. 05
    6. 06
    7. 07
    8. 08
    9. 09
    10. 10
    11. 11
    12. 12
    13. 13
    14. 14
    15. 15
    16. 16
    17. 17
    18. 18
    19. 19
    20. 20
    21. 21
    22. 22
    23. 23
    24. 24
    25. 25
    26. 26
    27. 27
    28. 28
    29. 29
    30. 30
    31. 31
    32. 32
    33. 33
    34. 34
    35. 35
    36. 36
    37. 37
    38. 38
    39. 39
    40. 40
    41. 41
    42. 42
    43. 43
    44. 44
    45. 45
    46. 46
    47. 47
    48. 48
    49. 49
    50. 50
    51. 51
    52. 52
    53. 53
    54. 54
    55. 55
    56. 56
    57. 57
    58. 58
    59. 59
    60. 60
    61. 61
    62. 62
    63. 63
    64. 64
    65. 65
    66. 66
    67. 67
    68. 68
    69. 69
    70. 70
    71. 71
    72. 72
    73. 73
    74. 74
    75. 75
    76. 76
    77. 77
    78. 78
    79. 79
    80. 80
    81. 81
    82. 82
    83. 83
    84. 84
    85. 85
    86. 86
    87. 87
    88. 88
    89. 89
    90. 90
    91. 91
    92. 92
    93. 93
    94. 94
    95. 95
    96. 96
    97. 97
    98. 98
    while usedthrds<>cn do
          begin
           i:=i+1;
           if manual=0 then
            if i>ccpun then
             break;
           if manual=1 then
            begin
             gotoxy(1,stroka);read(cputime[i]);
            end
           else
            begin
             gotoxy(1,stroka);write(cputime[i]);
            end;
           realsumcpu:=cputime[i]+ost;
           sumcpu:=cputime[i]+ost;
           found:=0;
           bin:=0;
           min:=1;max:=cn;
           search:
           while (min<=max) and (found=0) do
            begin
             bin:=bin+1;
             mid:=(min+max)div 2;
             if sumcpu<sortedthrd[mid] then
              max:=mid-1
             else
              if  sumcpu>sortedthrd[mid] then
               min:=mid+1
              else
               if used[mid]=1 then
                begin
                 if mid<>cn then
                  begin
                   l:=1;
                   while sortedthrd[mid+l]=sortedthrd[mid] do
                    begin
                     if used[mid+l]<>1 then
                      begin
                        mdldmas:=sortedthrd[mid+l];
                        mdldnum:=sortednum[mid+l];
                        ost:=realsumcpu-mdldmas;
                        used[mid+l]:=1;
                        found:=1;break;
                      end;
                    l:=l+1;
                    if mid+l>cn then break;
                  end;
              end;
            if (mid<>1) and (found=0) then
              begin
                l:=1;
                while sortedthrd[mid-l]=sortedthrd[mid] do
                  begin
                    if used[mid-l]<>1 then
                      begin
                        mdldmas:=sortedthrd[mid-l];
                        mdldnum:=sortednum[mid-l];
                        ost:=realsumcpu-mdldmas;
                        used[mid-l]:=1;
                        found:=1;break;
                      end;
                    l:=l+1;
                    if mid-l<1 then break;
                  end;
              end;
            break;
          end
        else
          begin
            mdldmas:=sortedthrd[mid];
            mdldnum:=sortednum[mid];
            used[mid]:=1;
            ost:=realsumcpu-mdldmas;
            found:=1;
            break;
          end;
      end;

if (found=0) and (sumcpu>0) then
  begin
    sumcpu:=sumcpu-1;bin:=0;min:=1;max:=cn;
    goto search;
  end;
if found=0 then
    ost:=realsumcpu
else
  begin
    gotoxy(6,stroka);write (realsumcpu);gotoxy (12,stroka);write (mdldmas);gotoxy(18,stroka);write(mdldnum);gotoxy(24,stroka);write(ost);gotoxy(30,stroka);write(bin);
    stroka:=stroka+1;
  end;
if found=1 then
  begin
    realsumcpu:=ost;
    sumcpu:=ost;
    found:=0;bin:=0;min:=1;max:=cn;
    goto search;
  end;

    Как студенты пишут сортировку (полная версия https://gist.github.com/Karasiq/11184652)

    Запостил: jkhne4pijgberg, 22 Апреля 2014

    Комментарии (5) RSS

    Добавить комментарий