CodingPractice/1079.c at main · kimhedol00/CodingPractice · GitHub

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
68
69
70
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int numTilePossibilities(char* tiles);

int dfs(int* cnt);


int numTilePossibilities(char* tiles) {
        int cnt[26] = {0, };
        for(int i = 0; i < strlen(tiles); ++i) ++cnt[tiles[i] - 'A'];
        return dfs(cnt);
    }

int dfs(int* cnt) {
    int res = 0;
    for (int i = 0; i < 26; ++i) {
        if (cnt[i]) {
            cnt[i]--;
            res += dfs(cnt) + 1;
            cnt[i]++;
        }
    }
    return res;
}

int main()
{
    char line[10000];
    scanf("%s", line);
    int ans = numTilePossibilities(line);
    printf("%d\n", ans);

    return 0;
}

/*
Best Solution
int count;
int check[26];

void f(int i,int n){
    if(i==n){
        count++;
        return;
    }
    for(int j=0;j<26;j++){
        if(check[j]>0){
            count++;
            check[j]--;
            f(i+1,n);
            check[j]++;
        }
    }

}
int numTilePossibilities(char * tiles){
    count=0;
    for(int i=0;i<26;i++){
        check[i]=0;
    }
    for(int i=0;i<strlen(tiles);i++){
        int a = tiles[i]-'A';
        check[a]++;
    }
    f(1,strlen(tiles));
    return count;
}
*/