题解 | 阶乘

#include<bits/stdc++.h>
using namespace std;

//求k的阶乘
int jiecheng(int k)
{
    if(k == 1||k == 0)return 1;
    else
    {
        return k*jiecheng(k-1);
    }
}

int main()
{
    int n;
    while(cin>>n)
    {
        int sum1 = 0;
        int sum2 = 0;
        for(int i = 1;i<=n;i++)
        {
            if(i % 2 == 1)
            {
                sum1 += jiecheng(i);
            }
            else
            {
                sum2 += jiecheng(i);
            }

        }
        cout<<sum1<<" "<<sum2;

    }
    return 0;
}