crazy.cpp/crazynew.cpp at master · jeek/crazy.cpp · 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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
#include <cmath>
#include <set>
#include <cstdio>
#include <string>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <algorithm>

struct record {
    int lower;
    int upper;
    long long result;
    char oper;
    long long left;
    long long right;
    bool operator <(const record& rhs) const {
        if (result != rhs.result) {
            return result < rhs.result;
        }
        if (lower != rhs.lower) {
            return lower < rhs.lower;
        }
        return upper < rhs.upper;
    }
};

struct seenitem {
    long long result;
    int lower;
    int upper;
    bool operator <(const seenitem& rhs) const {
        if (result != rhs.result) {
            return result < rhs.result;
        }
        if (lower != rhs.lower) {
            return lower < rhs.lower;
        }
        return upper < rhs.upper;
    };
    bool operator ==(const seenitem& rhs) const {
        if (result != rhs.result) {
            return false;
        }
        if (lower != rhs.lower) {
            return false;
        }
        if (upper != rhs.upper) {
            return false;
        }
        return true;
    };
};

long long concatenate(long long y, long long x) {
    long long pow = 10;
    while(y >= pow)
        pow *= 10;
    return x * pow + y;
}

std::string display(std::vector< record> &queue, long long i) {
    if (queue[i].oper == 'E') {
        return std::to_string(queue[i].result);
    }
    if (queue[i].oper == '+') {
        return "(" + display(queue, queue[i].right) + " + " + display(queue, queue[i].left) + ")";
    }
    if (queue[i].oper == '*') {
        return "(" + display(queue, queue[i].right) + " * " + display(queue, queue[i].left) + ")";
    }
    if (queue[i].oper == '^') {
        return "(" + display(queue, queue[i].right) + " ^ " + display(queue, queue[i].left) + ")";
    }
    return "Error";
}

int main(int argc, char *argv[]) {
    std::vector< record > queue;
    std::vector< std::set< long long > > leftq;
    std::vector< std::set< long long > > rightq;
    std::set<seenitem> seen;
    int base = 10; char *endptr;
    leftq.push_back(std::set<long long>());
    rightq.push_back(std::set<long long>());
    leftq.push_back(std::set<long long>());
    rightq.push_back(std::set<long long>());
    for (int i = 1 ; i < argc; i++) {
        leftq.push_back(std::set<long long>());
        rightq.push_back(std::set<long long>());
        record temp;
        (temp).left = -1;
        (temp).right = -1;
        (temp).oper = 'E';
        (temp).result = strtoll(argv[i], &endptr, base);
        (temp).lower = i;
        (temp).upper = i;
        seen.insert(seenitem({temp.result, temp.lower, temp.upper}));
        queue.push_back(temp);
        leftq[i].insert(queue.size()-1);
        rightq[i].insert(queue.size()-1);
//        std::cout << temp.result << std::endl;
    }
#ifdef CONCATENATION
    for (int i = 0 ; i < queue.size() ; i++) {
       for (int j = 0 ; j < queue.size() ; j++) {
           if ((queue[i].upper + 1) == (queue[j].lower)) {
               if ((queue[i].lower != 1 | queue[j].upper != (argc-1)) & seen.count(seenitem{concatenate(queue[j].result, queue[i].result), queue[i].lower, queue[j].upper}) == 0) {
//                   std::cout << concatenate(queue[j].result, queue[i].result) << " " << queue[i].lower << " " << queue[j].upper << " "  << std::endl;
                   seen.insert(seenitem({concatenate(queue[j].result, queue[i].result), queue[i].lower, queue[j].upper}));
                   queue.push_back(record({queue[i].lower, queue[j].upper, concatenate(queue[j].result, queue[i].result), 'E', j, i}));
                   leftq[queue[i].lower].insert(queue.size()-1);
                   rightq[queue[j].upper].insert(queue.size()-1);
               }
           }
       }
    }
#endif /* CONCATENATION */
    for (int i = 0 ; i < queue.size() ; i++) {
        std::cout << queue.size() << " " << i << " " << queue[i].result << " " << queue[i].lower << " " << queue[i].upper << std::endl;
        if ((queue[i].lower == 1) & (queue[i].upper == (argc - 1)) & (queue[i].result < UPPERLIMIT)) {
            std::cout << queue[i].result << " " << display(queue, i) << std::endl;
        }
        //for (int j = 0 ; j < queue.size() ; j++) {
        for (std::set<long long>::iterator it = leftq[queue[i+1].upper].begin() ; it != (leftq[queue[i+1].upper]).end(); ++it) {
           long long j = *it;
           std::cout << "    " << j << " " << queue[j].result << " " << queue[j].lower << " " << queue[j].upper << std::endl;
//           if ((queue[i].upper + 1) == (queue[j].lower)) {
#ifdef ADDITION
               if (seen.count(seenitem{queue[i].result + queue[j].result, queue[i].lower, queue[j].upper}) < 5) {
//                   std::cout << (queue[j].result + queue[i].result) << " " << queue[j].upper << " " << queue[i].lower << std::endl;
                   seen.insert(seenitem({(queue[i].result + queue[j].result), queue[i].lower, queue[j].upper}));
                   queue.push_back(record({queue[i].lower, queue[j].upper, (queue[j].result + queue[i].result), '+', j, i}));
                   leftq[queue[i].lower].insert(queue.size()-1);
                   rightq[queue[j].upper].insert(queue.size()-1);
               }
#endif /* ADDITION */
#ifdef MULTIPLICATION
               if (seen.count(seenitem{queue[i].result * queue[j].result, queue[i].lower, queue[j].upper}) < 5) {
//                   std::cout << (queue[j].result + queue[i].result) << " " << queue[j].upper << " " << queue[i].lower << std::endl;
                   seen.insert(seenitem({(queue[i].result * queue[j].result), queue[i].lower, queue[j].upper}));
                   queue.push_back(record({queue[i].lower, queue[j].upper, (queue[j].result * queue[i].result), '*', j, i}));
                   leftq[queue[i].lower].insert(queue.size()-1);
                   rightq[queue[j].upper].insert(queue.size()-1);
               }
#endif /* MULTIPLICATION */
#ifdef EXPONENTS
//               if (seen.count(seenitem{pow(queue[j].result, queue[i].result), queue[i].lower, queue[j].upper}) == 0) {
//                 if (queue[i].result * log10(queue[j].result) < log10(UPPERLIMIT)) {
//                   std::cout << (queue[j].result * queue[i].result) << " " << queue[j].upper << " " << queue[i].lower << std::endl;
//                   seen.insert(seenitem({pow(queue[j].result, queue[i].result), queue[i].lower, queue[j].upper}));
//                   queue.push_back(record({queue[i].lower, queue[j].upper, pow(queue[j].result, queue[i].result), '^', j, i}));
//                   leftq[queue[i].lower].insert(i);
//                   rightq[queue[j].upper].insert(j);
//                 }
//               }
#endif /* EXPONENTS */
//           }
        }
    }
}