1. Java / Говнокод #24737

    +1

    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
    for(int b = 0; b < len; b++){
            resultByte[b] = (byte)(buf[b] & 0xFF);
            crc32 ^= (buf[b] << 24);
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
            if(crc32 < 0) {crc32 = (crc32 << 1) ^ POLYNOMIAL;} else {crc32 = crc32 << 1;}
        }
        resultByte[len+3] = (byte)(crc32 & 0xFF);
        resultByte[len+2] = (byte)((crc32 >>> 8)  & 0xFF);
        resultByte[len+1] = (byte)((crc32 >>> 16) & 0xFF);
        resultByte[len]   = (byte)((crc32 >>> 24) & 0xFF);

    Запостил: MininN, 10 Сентября 2018

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

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