- 1
- 2
- 3
- 4
- 5
int main ()
{{{
return 0;
}}}-
Лучший говнокод
- В номинации:
-
- Лучший рейтинг
- Самый комментируемый
- За время:
-
- за сегодня
- за неделю
- за месяц
- за всё время
-
Си / Говнокод #126
+29
Я любил делать так... От этого хуже работать не будет, но вызывает вопросительное выражение лица.
guest,
12 Декабря 2008
Комментарии (7) -
C# / Говнокод #106
−11.8
- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
protected string TryToUpper(string text) { StringBuilder sb = new StringBuilder(); foreach(char t in text) { try { sb.Append(t.ToString().ToUpper()); } catch { sb.Append(t.ToString()); } } return sb.ToString(); } guest,
11 Декабря 2008
Комментарии (7) -
C++ / Говнокод #49
+30
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
void ListViewCtrl::SetEditableColumn(int col, bool editable) { while(col >= static_cast<int>(editableCols_.size())) { editableCols_.push_back(true); } editableCols_[col] = editable; }std::vector<bool> editableCols_;
вектор булов используется в ListView для того чтобы указать является ли столбец редактируемым...
p.s. польские паттерны) guest,
02 Декабря 2008
Комментарии (7) -
Haskell / Говнокод #29154
0
- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
(ql:quickload :cl-json) (defmacro penetrate-json (val shifrate) `(if (null ,shifrate) ,val) `(case ,shifrate (#XA (penetrate-json (car ,val) (cadr ,shifrate))) (#XF (penetrate-json (cdr ,val) (cadr ,shifrate))) (#XFF (penetrate-json (caadar ,val) (cadr ,shifrate))) (#XFA (penetrate-json (cddddr ,val) (cadr ,shifrate))) (#XAF (penetrate-json (caddar ,val) (cadr ,shifrate))) (#XFFF (penetrate-json (cdaadr ,val) (cadr ,shifrate))) (#XFAF (penetrate-json (cddadr ,val) (cadr ,shifrate))) (#XAAA (penetrate-json (caaddr ,val) (cadr ,shifrate))))) (let ((parsed (with-open-file (stream "C:/Users/lisps/PycharmProjects/pythonProject/.venv/Scripts/commonlisp/test" :direction :input) (json:decode-json-from-source stream)))) (setf (cdadar (penetrate-json (assoc :pidorasik parsed) `(,#XA ,#XFAF ,#XFFF ,#XAF ,#XF ,#XAAA ,#XFAF ,#XFF))) 100) ; oh my fucking gosh (with-open-file (stream "C:/Users/lisps/PycharmProjects/pythonProject/.venv/Scripts/commonlisp/test" :direction :output :if-exists :supersede) (json:encode-json parsed stream)))car/cdr ад
lisp-worst-code,
06 Июля 2025
Комментарии (6) -
Си / Говнокод #29115
0
- 1
#include <console_io.h>конио
3_dar,
03 Апреля 2025
Комментарии (6) -
Си / Говнокод #28998
+1
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
int iseven(long long int number) { struct Num { unsigned int x:1; unsigned int y:31; unsigned int z:32; } num = (*(struct Num*)(&number)); return num.x; //Если результат 1, то нечётное. }Функция определения чётности числа посредством возврата младшего бита.
TurboLyudoed,
11 Октября 2024
Комментарии (6) -
Си / Говнокод #28995
0
- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
longlong ** FUN_14000e5a0(longlong **param_1,LPCWSTR param_2,int param_3,uint param_4) { uint uVar1; longlong **pplVar2; longlong **hFile; longlong *plVar3; longlong **pplVar4; DWORD DVar5; LONG local_38; undefined4 uStack_34; pplVar4 = (longlong **)0x0; uVar1 = param_4 & 0x1f; if ((param_4 & 0x1f) == 0) { uVar1 = 2; } pplVar2 = FUN_1400119f8(DAT_1400213a0,(longlong)param_1); if (pplVar2 == (longlong **)0x0) { return (longlong **)0x0; } if (param_3 == 1) { DVar5 = (DWORD)((param_4 >> 0x11 & 1) != 0); if ((param_4 >> 0x12 & 1) != 0) { DVar5 = 7; } hFile = (longlong **) CreateFileW(param_2,0x80000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,3,0x80,(HANDLE)0x0); LAB_14000e70c: if (hFile == (longlong **)0xffffffffffffffff) goto LAB_14000e7ad; } else { if (param_3 == 2) { DVar5 = (DWORD)((param_4 >> 0x11 & 1) != 0); if ((param_4 >> 0x12 & 1) != 0) { DVar5 = 7; } hFile = (longlong **) CreateFileW(param_2,0xc0000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,4,0x80,(HANDLE)0x0); goto LAB_14000e70c; } if (param_3 != 3) { hFile = (longlong **)CONCAT44(uStack_34,local_38); goto LAB_14000e70c; } DVar5 = (DWORD)((param_4 >> 0x11 & 1) != 0); if ((param_4 >> 0x12 & 1) != 0) { DVar5 = 7; } hFile = (longlong **) CreateFileW(param_2,0xc0000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,2,0x80,(HANDLE)0x0); if (hFile == (longlong **)0xffffffffffffffff) { hFile = (longlong **) CreateFileW(param_2,0x40000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,5,0,(HANDLE)0x0); goto LAB_14000e70c; } } if (hFile != (longlong **)0x0) { if ((DAT_14001f140 == 0) || ((param_4 >> 0x13 & 1) != 0)) { pplVar2[1] = (longlong *)0x0; } else { plVar3 = (longlong *)HeapAlloc(DAT_1400204cc,0,(longlong)DAT_14001f140); pplVar2[1] = plVar3; } *pplVar2 = (longlong *)hFile; *(int *)(pplVar2 + 2) = DAT_14001f140; *(undefined4 *)((longlong)pplVar2 + 0x14) = 0; *(uint *)(pplVar2 + 4) = uVar1; *(uint *)((longlong)pplVar2 + 0x24) = (uint)(param_3 == 1); *(undefined4 *)((longlong)pplVar2 + 0x1c) = 1; if ((param_3 == 2) && ((param_4 >> 0x14 & 1) != 0)) { local_38 = 0; SetFilePointer(hFile,0,&local_38,2); } pplVar4 = hFile; if (param_1 == (longlong **)0xffffffffffffffff) { pplVar4 = pplVar2; } if (pplVar4 != (longlong **)0x0) { return pplVar4; } } LAB_14000e7ad: if (param_1 == (longlong **)0xffffffffffffffff) { param_1 = pplVar2; } FUN_14001192c(DAT_1400213a0,(longlong)param_1); return pplVar4; }
BelCodeMonkey,
06 Октября 2024
Комментарии (6) -
Си / Говнокод #28950
0
- 001
- 002
- 003
- 004
- 005
- 006
- 007
- 008
- 009
- 010
- 011
- 012
- 013
- 014
- 015
- 016
- 017
- 018
- 019
- 020
- 021
- 022
- 023
- 024
- 025
- 026
- 027
- 028
- 029
- 030
- 031
- 032
- 033
- 034
- 035
- 036
- 037
- 038
- 039
- 040
- 041
- 042
- 043
- 044
- 045
- 046
- 047
- 048
- 049
- 050
- 051
- 052
- 053
- 054
- 055
- 056
- 057
- 058
- 059
- 060
- 061
- 062
- 063
- 064
- 065
- 066
- 067
- 068
- 069
- 070
- 071
- 072
- 073
- 074
- 075
- 076
- 077
- 078
- 079
- 080
- 081
- 082
- 083
- 084
- 085
- 086
- 087
- 088
- 089
- 090
- 091
- 092
- 093
- 094
- 095
- 096
- 097
- 098
- 099
- 100
/* Brainfuck-C ( http://github.com/kgabis/brainfuck-c ) Copyright (c) 2012 Krzysztof Gabis Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ #include <stdio.h> #define OP_END 0 #define OP_INC_DP 1 #define OP_DEC_DP 2 #define OP_INC_VAL 3 #define OP_DEC_VAL 4 #define OP_OUT 5 #define OP_IN 6 #define OP_JMP_FWD 7 #define OP_JMP_BCK 8 #define SUCCESS 0 #define FAILURE 1 #define PROGRAM_SIZE 4096 #define STACK_SIZE 512 #define DATA_SIZE 65535 #define STACK_PUSH(A) (STACK[SP++] = A) #define STACK_POP() (STACK[--SP]) #define STACK_EMPTY() (SP == 0) #define STACK_FULL() (SP == STACK_SIZE) struct instruction_t { unsigned short operator; unsigned short operand; }; static struct instruction_t PROGRAM[PROGRAM_SIZE]; static unsigned short STACK[STACK_SIZE]; static unsigned int SP = 0; int compile_bf(FILE* fp) { unsigned short pc = 0, jmp_pc; int c; while ((c = getc(fp)) != EOF && pc < PROGRAM_SIZE) { switch (c) { case '>': PROGRAM[pc].operator = OP_INC_DP; break; case '<': PROGRAM[pc].operator = OP_DEC_DP; break; case '+': PROGRAM[pc].operator = OP_INC_VAL; break; case '-': PROGRAM[pc].operator = OP_DEC_VAL; break; case '.': PROGRAM[pc].operator = OP_OUT; break; case ',': PROGRAM[pc].operator = OP_IN; break; case '[': PROGRAM[pc].operator = OP_JMP_FWD; if (STACK_FULL()) { return FAILURE; } STACK_PUSH(pc); break; case ']': if (STACK_EMPTY()) { return FAILURE; } jmp_pc = STACK_POP(); PROGRAM[pc].operator = OP_JMP_BCK; PROGRAM[pc].operand = jmp_pc; PROGRAM[jmp_pc].operand = pc; break; default: pc--; break; } pc++; } if (!STACK_EMPTY() || pc == PROGRAM_SIZE) { return FAILURE; } PROGRAM[pc].operator = OP_END; return SUCCESS; } int execute_bf() { unsigned short data[DATA_SIZE], pc = 0; unsigned int ptr = DATA_SIZE; while (--ptr) { data[ptr] = 0; } while (PROGRAM[pc].operator != OP_END && ptr < DATA_SIZE) { // (...)Интерпретатор Brainfuck.
Полный код можно посмотреть тута:
https://github.com/kgabis/brainfuck-c/blob/master/brainfuck.c
kNode,
02 Июля 2024
Комментарии (6) -
Swift / Говнокод #28823
0
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
status = message.status if message.status == .delivered || message.status == .failed || message.status == .read { button.isHidden == false button.isUserInteractionEnabled = true } else { button.isHidden == true button.isUserInteractionEnabled = false }песааатель
alexis-ag,
21 Июля 2023
Комментарии (6) -
Си / Говнокод #28643
+1
- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
#include <stdio.h> #include <conio.h> #include <stdlib.h> void PasswordChecker(void); void sub_BB4F(unsigned char* Password);//subroutine $BB4F and so on... void sub_BB21(void); void sub_BBE0(void); void sub_BBEA(void); void SEC_SBC_6502(unsigned char operand); void ADC_6502_simplified(unsigned char operand); unsigned char Password[8];//$0766 to $076D in RAM, when a player enters it unsigned char Invalidity=0;//$0764 in RAM unsigned char Level;//$$0070 in RAM unsigned char TimeTens;//$04c5 in RAM unsigned char TimeOnes;//$04c6 in RAM unsigned char Byte4BF, Byte17, Byte18; unsigned char a, x; unsigned char c=0;//carry flag //former char Byte76A is Password[4] now, former char Byte76C is Password[6] now void PasswordGenerator(void); void BuildORTable(void); unsigned char* BuildParticularLevelsArray(unsigned char DesiredLevel);//will think of it later... void SimplifiedLevelGenerator(unsigned char* PassToFill,unsigned char Level);//finds just one 2nd,3rd,6th,8th digit combo int main() { int Choice; printf("Enter g if you'd like to generate a new password.\nEnter a to analyze an existing password.\n"); Choice=fgetc(stdin); flushall(); if (Choice=='a') PasswordChecker(); if (Choice=='g') PasswordGenerator(); if (Choice=='s')//'level function' is basic when generating a pass BuildORTable();//so here a bit of 'hidden' investigation, which will be useful //if I ever decide to rewrite this prog to output all passes possible, not just one printf("Press any key to quit.\n"); getch(); return 0; } void PasswordChecker(void) { char InputString[9];//one extra byte needed due to fgets int i; printf("Please enter your password to test:\n"); fgets(InputString,9,stdin); for(i=0;i<8;i++) { if ((InputString[i]>57)||(InputString[i]<48)) { printf("This string contains non-digits.\n"); return; } else Password[i]=InputString[i]-48;//ascii to digit } sub_BB4F(Password); if (Invalidity==1) { printf("This password is invalid.\n"); return; } printf("%s%d","Level: ",Level); printf("%s%d%d\n"," Time: ",TimeTens,TimeOnes); if (Level==15) printf("Level 15 doesn't exist. So-called level 15 passwords are programming mistakes and cause system hang.\n"); if (Level==16) printf("Level 16 doesn't exist. So-called level 16 passwords are programming mistakes and lead you to a buggy screen where Prince can't move.\n"); return; } void sub_BB4F(unsigned char* Password)//$BB4F { a=0; x=0; while (x<8) { a=a+Password[x]; x++; } if(a==0) { Invalidity=1;//$BBC0 return; } Byte17=Password[4];//$BB63 Byte18=Password[6]; Password[4]=0; Password[6]=0; sub_BB21();//$BB72,calculates and writes 1st checksum to Password[4], 2nd checksum to Password[6] if (Password[4]!=Byte17) { Invalidity=1; return; }Генератор паролей для игры Prince Of Perisa. Пришлось немного повозиться...
if (Password[6]!=Byte18)//$BB7C
{
Invalidity=1;
return;
}
Invalidity=0;//$BB85
a=Password[7];
sub_BBEA();
a=a&3;//$BB8E
a=a*4;
Password[7]=a;
a=Password[1];
sub_BBE0();//$BB98
a=a|Password[7];
Level=a+1;//+1 is my insertion
//if (Level!=1)//I chose to omit this $BBA2-$BBA4 code b/c it's unknown what byte at $06EE means
a=Password[0];
sub_BBE0();//$BBAA
TimeTens=a;
a=Password[3];
sub_BBEA();
TimeOnes=a;
return;//$BBBF
}
void SEC_SBC_6502(unsigned char operand)
{
c=1;
if ((a-operand)>=0)
a=a-operand;
else
{
a=a-operand+256;
c=0;
};
}
void ADC_6502_simplified(unsigned char operand)
{
if ((a+operand)<256)
a=a+operand;
else a=a+operand-256;
}
void sub_BB21(void)
{
x=0;
BB23: a=Password[4];
a=a+Password[x];
if(a<10)
{
BB46: Password[4]=a;//$BB46
x++;
if (x!=8)
goto BB23;
else return;//$BB4E
}
else //$BB2E
{
Byte4BF=a;
a=Password[6];
a++;//we came here b/c c=1
if (a<10)
goto BB3D;
else
SEC_SBC_6502(10);//can we get here? I doubt...
BB3D: Password[6]=a;
a=Byte4BF;
SEC_SBC_6502(10);//$BB44, no danger of negative result
goto BB46;
}
}
cepreu_monoJlb,
19 Марта 2023
Комментарии (6)
Follow us!