Fireworks-PreScreen

#define A(x) <B(x)>
#define B(x) x.h
#define C(x,y) D(x,y)
#define D(x,y) x ## y
#define E C(G,H)
#define F C(G,J)

#define G std
#define H io
#define I math
#define J bool
#define K int
#define L for
#define M return
#define N sizeof
#define O long
#define P if
#define Q double
#define R const
#define S fabs
#define T else

#include A(E)
#include A(F)
#include A(I)        

R O O K n[] = {
    442519980697,
    -648958014358109,
    64864750868537,
    -228065488292773,
    634588040579,
    -859048156117,
    17355913261,
    -419603777,
    10784621,
    -693533
};

R O O K d[] = {
    496215720,
    764172208800,
    191043052200,
    3056688835200,
    63681017400,
    1018896278400,
    382086104400,
    277880803200,
    382086104400,
    3056688835200
};

J f(K y, K x) {
    Q s = 1;
    O O K z = 1;
    L (K i = 0; i < 10; i++) {
        
        z *= x;
        s += (Q) n[i] * z / d[i];
        
    }
    
    M S(s - y) < 0.0001;
}

//65 85 84
int main() {
    int a[] = {
        70, 82, 79, 69, 82, 68, 87, 71, 72, 82, 73, 69, 76, 69, 69, 78,
        '?', 66, '?', 76, '?', 85, '?', 69
    };
    int z = 0;
    for (int i = 0; i < sizeof(a) / sizeof(a[0]) - 1; i++) {
        const bool y = f(a[i + 1] - 65, a[i] - 65);
       
        if (!(a[i] - 63)) {
            putchar('?');
            z = 1;
        }
        else if(y) {
            putchar(a[i + 1]);
            i++;
        }
    }
    return z;
}