summaryrefslogtreecommitdiff
path: root/combinations.c
blob: 5237647e45ff5cdfb22afa86bd612a1a1c28be48 (plain)
1
2
3
4
5
6
7
8
9
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
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>

void swap(char *a, char *b);
void permute(char *s, int l, int r);
unsigned long long fact(int n);

const char red[] = "\033[31m";
const char white[] = "\033[37m";
const char norm[] = "\033[0m";

int main(int argc, char **argv) {
    if (argc != 2) {
        printf("%scmb%s>%s at least give me a string :(\n", red, white, norm);
        return 1;
    }
    
    char warn = 'n';
    char *str = strdup(argv[1]);
    
    unsigned long long iter_num = fact(strlen(str));

    printf("%scmb%s>%s iteration count: %ld! = %llu\n", red, white, norm, strlen(str), iter_num);
    
    if (strlen(str) >= 6) {
        printf("%scmb%s>%s warning, your string is %ld characters long.\n", red, white, norm, strlen(str));
        printf("%scmb%s>%s the output %s*will*%s be %shuge%s, continue? (y/n)\n? ", red, white, norm, red, norm, red, norm);
        scanf(" %c", &warn);
        if (warn == 'n') {
            printf("%scmb%s>%s quitting gracefully..\n", red, white, norm);
            free(str);
            return 1;
        }
    }

    printf("%scmb%s>%s ", red, white, norm); // without \n -> prints the given string, *wink* *wink* :)
    permute(str, 0, strlen(str) - 1);

    free(str);
    return 0;
}

void swap(char *a, char *b) {
    char tmp = *a;
    *a = *b;
    *b = tmp;
}

void permute(char *s, int l, int r) {
    if (l == r) {
        printf("%s\n", s);
        return;
    }

    for (int i = l; i <= r; i++) {
        swap(&s[l], &s[i]); 
        permute(s, l + 1, r);
        swap(&s[l], &s[i]); 
    }
}

unsigned long long fact(int n) {
    return (n <= 1) ? 1 : n * fact(n - 1);
}