1.19.cpp

来自「严蔚敏数据结构习题C++实现」· C++ 代码 · 共 52 行

#include <iostream>
#include <math.h>
#include <limits> 
using namespace std; 
#define aarise 30
#define OVER -1
#define OK 0
#define OVERFLOW 1
#define intMax numeric_limits<int>::max()
int array(int n,int A[]);

int main()
{
    int state;
    int n;
    
    int A[aarise];
    cin >> n;
    state = array(n,A);
    if(state == OK)
    { 
        cout << "OK" << endl;
        for(int i=0; i<=n-1; i++)
            cout << A[i] << endl;
    }
    if(state == OVER)
        cout << "OVER";
    if(state == OVERFLOW)
        cout << "OVERFLOW";
    
    
    
    system("pause");
    return 0;
}
int array(int n,int A[])
{
       if(n > aarise)
            return OVER;
       A[0] = 1;
       for(int i=1; i<=n-1; i++)
       {
            double result = pow(2,i);
            for(int j=1; j<=i; j++)
                result *= j;
            if(result > intMax)
                return OVERFLOW;
            A[i] = result;
       }
       return OK;
}