Exemplo n.º 1
0
int main() {
    nMasUno[1].clear();
    nMasUno[1].grado = 1;
    nMasUno[1].coef[0] = 1;
    nMasUno[1].coef[1] = 1;
    for(int i = 2; i < 101; i++) {
        nMasUno[i].copyFrom(&nMasUno[i - 1]);
        nMasUno[i] *= &nMasUno[1];
    }
    int caso = 1;
    while(true) {
        Polynom *actual = leer();
        bool es = true;
        if(actual == NULL)
            break;
        for(int i = 0; i < 200; i++)
        {
            if((actual->eval(i) % D) != 0)
                es = false;
        }
        if(es) {
            printf("Case %d: Always an integer\n", caso++);
        }
        else {
            printf("Case %d: Not always an integer\n", caso++);
        }
        delete actual;
    }
}