Usaco-Programs/Name That Number at master · Mitgorakh/Usaco-Programs · 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
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
/*
ID: gorakhm1
PROG: namenum
LANG: C++
*/
#include <iostream>
#include <cstring>
#include <cstdio>
#include <set>

#define MAX 15
#define N 5010

using namespace std;

void generateAll(int i, char a[MAX]);
void binarySearch(int l, int r, char a[MAX]);

std::set<string> mySet;
std::set<string>::iterator it;

struct dig{
    char alpha[3];

}digits[10];


char dictionary[N][MAX];
char s[MAX];
int n, m, counter;
FILE *fp1, *fp2, *fp3;

void generateAll(int i, char a[MAX]){
    int j, k;
    char b[MAX];
    memset(b, 0, MAX);
    strcpy(b, a);

    if(i == n - 1){
        for(j = 0; j < 3; j++){
            b[i] = digits[s[i] - '0'].alpha[j];

            string shiz(b);
            it = mySet.find(shiz);
            if(it != mySet.end()){
                fprintf(fp3, "%s\n", b);
                counter++;
            }

        }
    }

    else{
        for(j = 0; j < 3; j++){
            b[i] = digits[s[i] - '0'].alpha[j];
            generateAll(i + 1, b);
        }

    }

}
/*
void binarySearch(int l, int r, char a[MAX]){
    int mid = (l + r ) / 2;

    if(r < l)
        return;

    int cmp = strcmp(dictionary[mid], a);

    if(cmp == 0){
        fprintf(fp3, "%s\n", a);
        counter++;
        return;
    }

    else if(cmp < 0)
        binarySearch(l + 1, r, a);

    else if(cmp > 0)
        binarySearch(l, r - 1, a);

}*/


int main()
{

    fp1 = fopen("dict.txt", "r");
    fp2 = fopen("namenum.in", "r");
    fp3 = fopen("namenum.out", "w");
    int i, j, k;


    i = 0;
    while(!feof(fp1)){
        fscanf(fp1, "%s", dictionary[i]);
        i++;
    }

    m = i - 1;

    for(i = 0; i <= m; i++){
        string shiz(dictionary[i]);
        mySet.insert(shiz);
    }

    fscanf(fp2, "%s", s);

    //scanf("%s", s);
    n = strlen(s);


    char ch = 'A';
    for(i = 2; i <= 9; i++){
        for(j = 0; j < 3; j++){
            if(ch == 'Q')
                ch++;
            digits[i].alpha[j] = ch;
            ch++;
        }
    }

    /*for(std::set<char *> ::iterator it = mySet.begin(); it != mySet.end(); it++)
        cout << *it << endl;*/


    char a[MAX];
    memset(a, 0, MAX);
    generateAll(0, a);
    if(counter == 0)
        fprintf(fp3, "NONE\n");


    return 0;
}