I hereby claim:
- I am EmilHernvall on github.
- I am aderyn (https://keybase.io/aderyn) on keybase.
- I have a public key whose fingerprint is 5B7E 106F 7A1F B3B2 8236 78E1 398A 0566 9E87 493F
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
#include <stdio.h> | |
#include <stdlib.h> | |
#define FormatID 'fmt ' /* chunkID for Format Chunk. NOTE: There is a space at the end of this ID. */ | |
struct GlobalFormat { | |
unsigned int id; | |
unsigned int size; | |
unsigned int type; | |
}; |
#include <stdio.h> | |
#include <math.h> | |
/* | |
The algorithm is: | |
d_i = (c mod 10^(i+1)) / 10^i | |
S = sum_{i=0}^{floor(log_10(c))+1} d_i = sum_{i=0}^{floor(log_10(c))+1} (c mod 10^(i+1)) / 10^i | |
Where c is the number in question, d_i is the digit at position i counted from the least significant digit | |
and S is the sum of the digits in the number. |
#include <stdio.h> | |
#include <stdlib.h> | |
int expand(char *target, int size, char *format, char **params, int count) | |
{ | |
int i, placeholders = 0; | |
for (i = 0; i < strlen(format); i++) { | |
if (format[i] == '?') { | |
placeholders++; | |
} |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
int explode(char*** ret, char* instr, char* delim) | |
{ | |
char* str = strdup(instr); | |
char** arr = (char**)malloc(sizeof(char*) * (strlen(instr)+1)); | |
int count = 0; |
// perm.c - setuid to another user and give group members write permission | |
// to files with certain extensions. | |
// Emil Hernvall, 2008-04-14 | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <unistd.h> | |
#include <sys/types.h> | |
#include <dirent.h> | |
#include <string.h> |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <math.h> | |
int main(int argc, char** argv) | |
{ | |
if (argc != 2) { | |
printf("usage: genprimes2 num\n"); | |
return 0; | |
} |
def Denary2Binary(n): | |
'''convert denary integer n to binary string bStr''' | |
bStr = '' | |
if n < 0: raise ValueError, "must be a positive integer" | |
if n == 0: return '0' | |
while n > 0: | |
bStr = str(n % 2) + bStr | |
n = n >> 1 | |
return bStr |
// this has hacky support for swedish characters in utf8. | |
// i do not recommend this solution for any serious purposes. :) | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
#include <wchar.h> | |
// convert a twobyte utf8 character into a single integer | |
#define MB(str) (((str[0] & 0xFF) << 8) | (str[1] & 0xFF)) |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <string.h> | |
typedef struct word_ { | |
char *str; | |
int c; | |
struct word_ *next; | |
} word; |