题目1179：阶乘

#include<iostream>#include <vector>#include <queue>#include <stack>#include <sstream>using namespace std;//1179int n;long long int getR(int n){    if(n==1) return 1;    else    return n*getR(n-1);}int main(){    while(cin>>n){        long long int y1=0;        long long int y2=0;        for(int i=1;i<=n;i+=2)            y1+=getR(i);        for(int i=2;i<=n;i+=2)            y2+=getR(i);        cout<<y1<<" "<<y2<<endl;    }    return 0;}/**************************************************************    Problem: 1179    User: cust123    Language: C++    Result: Accepted    Time:10 ms    Memory:1520 kb****************************************************************/