求n的阶乘,要用模板(两个模型参数),自动判断输入的数是整形还是double型.急急急!!

Sheldon_ 2014-04-02 08:48:00
求n的阶乘,要用模板(两个模型参数),自动判断输入的数是整形还是double型
...全文
208 10 打赏 收藏 转发到动态 举报
写回复
用AI写文章
10 条回复
切换为时间正序
请发表友善的回复…
发表回复
kuankuan_qiao 2014-04-12
  • 打赏
  • 举报
 回复
regainworld 2014-04-12
  • 打赏
  • 举报
 回复
输入整数，输出double？
因为输出值超整数范围
Sheldon_ 2014-04-06
  • 打赏
  • 举报
 回复
引用 7 楼 zcdabing 的回复:
[quote=引用 6 楼 zcdabing 的回复:] 

string s1="int";
string s2="double";
//S是你要验证的参数
if(s1.c_str()==typeid(S).name())
    ...//do something
else if(s1.c_str()==typeid(S).name())
    ...//do something
不知道这样行不行？
写错一个地方 else if(s2.c_str()==typeid(S).name())[/quote] 感觉是我没理解我们老师的问题还是我们老师表达不清楚，我也不知道他要我们求什么…… 不过你这个对我有点启发。
zcdabing 2014-04-06
  • 打赏
  • 举报
 回复
引用 6 楼 zcdabing 的回复:

string s1="int";
string s2="double";
//S是你要验证的参数
if(s1.c_str()==typeid(S).name())
    ...//do something
else if(s1.c_str()==typeid(S).name())
    ...//do something
不知道这样行不行？
写错一个地方 else if(s2.c_str()==typeid(S).name())
zcdabing 2014-04-06
  • 打赏
  • 举报
 回复 

string s1="int";
string s2="double";
//S是你要验证的参数
if(s1.c_str()==typeid(S).name())
    ...//do something
else if(s1.c_str()==typeid(S).name())
    ...//do something
不知道这样行不行？
Sheldon_ 2014-04-06
  • 打赏
  • 举报
 回复
引用 3 楼 zhao4zhong1 的回复:
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int COMPARE(string number1, string number2) {
    int i,j;

    int length1 = number1.size();
    int length2 = number2.size();

    if(number1.size() == 0) number1 = "0";
    if(number2.size() == 0) number2 = "0";

    j = 0;
    for(i = 0; i < length1; ++i) {
        if(number1[i] == '0') ++j;
        else break;
    }
    number1 = number1.substr(j);

    j = 0;
    for(i = 0; i < length2; ++i) {
        if(number2[i] == '0') ++j;
        else break;
    }
    number2 = number2.substr(j);

    length1 = number1.size();
    length2 = number2.size();

    if(length1 > length2) {
        return 1;
    } else if(length1 == length2) {
        if(number1.compare(number2) > 0) {
            return 1;
        } else if(number1.compare(number2) == 0) {
            return 0;
        } else {
            return -1;
        }
    } else {
        return -1;
    }

    return 0;
}
string PLUS(string number1,string number2) {
    int i;
    int length1 = number1.size();
    int length2 = number2.size();

    string result="";

    reverse(number1.begin(), number1.end());
    reverse(number2.begin(), number2.end());

    for(i = 0; i < length1 && i < length2; i++) {
        char c = (char)(number1[i] + number2[i] - 48);
        result = result + c;
    }

    while(i < length1) {
        result = result + number1[i];
        ++i;
    }

    while(i < length2) {
        result = result + number2[i];
        ++i;
    }

    int carry = 0;
    for(i = 0; i < (int)result.size(); ++i) {
        int value = result[i] - 48 + carry;
        result[i] = (char)(value % 10 + 48);
        carry = value / 10;
    }

    if(carry !=0 ) {
        result = result + (char)(carry + 48);
    }

    for(i = result.size() - 1; i >= 0; i--) {
        if(result[i] != '0') break;
    }

    result = result.substr(0, i + 1);

    reverse(result.begin(), result.end());
    if(result.length() == 0) result = "0";
    return result;
}
string MINUS(string number1,string number2) {
    int i;
    string result = "";

    int length1 = number1.size();
    int length2 = number2.size();

    if(COMPARE(number2,number1) > 0) {
        return "-" + MINUS(number2, number1);
    }

    reverse(number1.begin(),number1.end());
    reverse(number2.begin(),number2.end());

    for(i = 0; i < length1 && i < length2; i++) {
        char c = number1[i] - number2[i] + 48;
        result = result + c;
    }

    if(i < length1) {
        for(; i < length1; i++) {
            result = result + number1[i];
        }
    }

    int carry = 0;
    for(i = 0; i < (int)result.length(); i++) {
        int value = result[i] - 48 + carry;
        if(value < 0) {
            value = value + 10;
            carry = -1;
        } else carry = 0;
        result[i]=(char)(value + 48);
    }

    for(i = result.size() - 1; i >= 0; i--) {
        if(result[i] != '0')break;
    }

    result = result.substr(0, i+1);

    reverse(result.begin(), result.end());
    if(result.length()==0) result = "0";
    return result;
}
string MULTIPLY(string number1, string number2) {
    int i, j;
    int *iresult;
    int length1 = number1.size();
    int length2 = number2.size();
    string result = "";

    reverse(number1.begin(), number1.end());
    reverse(number2.begin(), number2.end());

    iresult = (int*)malloc(sizeof(int) * (length1 + length2 + 1));
    memset(iresult, 0, sizeof(int) * (length1 + length2 + 1));

    for(i = 0; i < length1; i++) {
        for(j = 0; j < length2; j++) {
            iresult[i+j] += ((number1[i] - 48) * (number2[j] - 48));
        }
    }

    int carry = 0;
    for(i = 0; i < length1 + length2; i++) {
        int value = iresult[i] + carry;
        iresult[i] = value % 10;
        carry = value / 10;
    }

    for(i = length1 + length2 - 1; i >= 0; i--) {
        if(iresult[i] != 0)break;
    }

    for(; i >= 0; i--) {
        result = result + (char)(iresult[i]+48);
    }

    free(iresult);

    if(result == "") result = "0";
    return result;
}
string factorial(string n) {
    string temp = "1";
    string i;
    for(i = "1"; COMPARE(i, n) <= 0; i = PLUS(i, "1")) {
        temp = MULTIPLY(temp, i);
    }
    return temp;
}
int main(void) {
    cout << factorial("100") << endl;
    return 0;
}
这么多……还看不懂
杀意已决 2014-04-04
  • 打赏
  • 举报
 回复
引用 3 楼 zhao4zhong1 的回复:
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int COMPARE(string number1, string number2) {
    int i,j;

    int length1 = number1.size();
    int length2 = number2.size();

    if(number1.size() == 0) number1 = "0";
    if(number2.size() == 0) number2 = "0";

    j = 0;
    for(i = 0; i < length1; ++i) {
        if(number1[i] == '0') ++j;
        else break;
    }
    number1 = number1.substr(j);

    j = 0;
    for(i = 0; i < length2; ++i) {
        if(number2[i] == '0') ++j;
        else break;
    }
    number2 = number2.substr(j);

    length1 = number1.size();
    length2 = number2.size();

    if(length1 > length2) {
        return 1;
    } else if(length1 == length2) {
        if(number1.compare(number2) > 0) {
            return 1;
        } else if(number1.compare(number2) == 0) {
            return 0;
        } else {
            return -1;
        }
    } else {
        return -1;
    }

    return 0;
}
string PLUS(string number1,string number2) {
    int i;
    int length1 = number1.size();
    int length2 = number2.size();

    string result="";

    reverse(number1.begin(), number1.end());
    reverse(number2.begin(), number2.end());

    for(i = 0; i < length1 && i < length2; i++) {
        char c = (char)(number1[i] + number2[i] - 48);
        result = result + c;
    }

    while(i < length1) {
        result = result + number1[i];
        ++i;
    }

    while(i < length2) {
        result = result + number2[i];
        ++i;
    }

    int carry = 0;
    for(i = 0; i < (int)result.size(); ++i) {
        int value = result[i] - 48 + carry;
        result[i] = (char)(value % 10 + 48);
        carry = value / 10;
    }

    if(carry !=0 ) {
        result = result + (char)(carry + 48);
    }

    for(i = result.size() - 1; i >= 0; i--) {
        if(result[i] != '0') break;
    }

    result = result.substr(0, i + 1);

    reverse(result.begin(), result.end());
    if(result.length() == 0) result = "0";
    return result;
}
string MINUS(string number1,string number2) {
    int i;
    string result = "";

    int length1 = number1.size();
    int length2 = number2.size();

    if(COMPARE(number2,number1) > 0) {
        return "-" + MINUS(number2, number1);
    }

    reverse(number1.begin(),number1.end());
    reverse(number2.begin(),number2.end());

    for(i = 0; i < length1 && i < length2; i++) {
        char c = number1[i] - number2[i] + 48;
        result = result + c;
    }

    if(i < length1) {
        for(; i < length1; i++) {
            result = result + number1[i];
        }
    }

    int carry = 0;
    for(i = 0; i < (int)result.length(); i++) {
        int value = result[i] - 48 + carry;
        if(value < 0) {
            value = value + 10;
            carry = -1;
        } else carry = 0;
        result[i]=(char)(value + 48);
    }

    for(i = result.size() - 1; i >= 0; i--) {
        if(result[i] != '0')break;
    }

    result = result.substr(0, i+1);

    reverse(result.begin(), result.end());
    if(result.length()==0) result = "0";
    return result;
}
string MULTIPLY(string number1, string number2) {
    int i, j;
    int *iresult;
    int length1 = number1.size();
    int length2 = number2.size();
    string result = "";

    reverse(number1.begin(), number1.end());
    reverse(number2.begin(), number2.end());

    iresult = (int*)malloc(sizeof(int) * (length1 + length2 + 1));
    memset(iresult, 0, sizeof(int) * (length1 + length2 + 1));

    for(i = 0; i < length1; i++) {
        for(j = 0; j < length2; j++) {
            iresult[i+j] += ((number1[i] - 48) * (number2[j] - 48));
        }
    }

    int carry = 0;
    for(i = 0; i < length1 + length2; i++) {
        int value = iresult[i] + carry;
        iresult[i] = value % 10;
        carry = value / 10;
    }

    for(i = length1 + length2 - 1; i >= 0; i--) {
        if(iresult[i] != 0)break;
    }

    for(; i >= 0; i--) {
        result = result + (char)(iresult[i]+48);
    }

    free(iresult);

    if(result == "") result = "0";
    return result;
}
string factorial(string n) {
    string temp = "1";
    string i;
    for(i = "1"; COMPARE(i, n) <= 0; i = PLUS(i, "1")) {
        temp = MULTIPLY(temp, i);
    }
    return temp;
}
int main(void) {
    cout << factorial("100") << endl;
    return 0;
}
一边carry，一边counter，楼主come on
赵4老师 2014-04-04
  • 打赏
  • 举报
 回复 
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int COMPARE(string number1, string number2) {
    int i,j;

    int length1 = number1.size();
    int length2 = number2.size();

    if(number1.size() == 0) number1 = "0";
    if(number2.size() == 0) number2 = "0";

    j = 0;
    for(i = 0; i < length1; ++i) {
        if(number1[i] == '0') ++j;
        else break;
    }
    number1 = number1.substr(j);

    j = 0;
    for(i = 0; i < length2; ++i) {
        if(number2[i] == '0') ++j;
        else break;
    }
    number2 = number2.substr(j);

    length1 = number1.size();
    length2 = number2.size();

    if(length1 > length2) {
        return 1;
    } else if(length1 == length2) {
        if(number1.compare(number2) > 0) {
            return 1;
        } else if(number1.compare(number2) == 0) {
            return 0;
        } else {
            return -1;
        }
    } else {
        return -1;
    }

    return 0;
}
string PLUS(string number1,string number2) {
    int i;
    int length1 = number1.size();
    int length2 = number2.size();

    string result="";

    reverse(number1.begin(), number1.end());
    reverse(number2.begin(), number2.end());

    for(i = 0; i < length1 && i < length2; i++) {
        char c = (char)(number1[i] + number2[i] - 48);
        result = result + c;
    }

    while(i < length1) {
        result = result + number1[i];
        ++i;
    }

    while(i < length2) {
        result = result + number2[i];
        ++i;
    }

    int carry = 0;
    for(i = 0; i < (int)result.size(); ++i) {
        int value = result[i] - 48 + carry;
        result[i] = (char)(value % 10 + 48);
        carry = value / 10;
    }

    if(carry !=0 ) {
        result = result + (char)(carry + 48);
    }

    for(i = result.size() - 1; i >= 0; i--) {
        if(result[i] != '0') break;
    }

    result = result.substr(0, i + 1);

    reverse(result.begin(), result.end());
    if(result.length() == 0) result = "0";
    return result;
}
string MINUS(string number1,string number2) {
    int i;
    string result = "";

    int length1 = number1.size();
    int length2 = number2.size();

    if(COMPARE(number2,number1) > 0) {
        return "-" + MINUS(number2, number1);
    }

    reverse(number1.begin(),number1.end());
    reverse(number2.begin(),number2.end());

    for(i = 0; i < length1 && i < length2; i++) {
        char c = number1[i] - number2[i] + 48;
        result = result + c;
    }

    if(i < length1) {
        for(; i < length1; i++) {
            result = result + number1[i];
        }
    }

    int carry = 0;
    for(i = 0; i < (int)result.length(); i++) {
        int value = result[i] - 48 + carry;
        if(value < 0) {
            value = value + 10;
            carry = -1;
        } else carry = 0;
        result[i]=(char)(value + 48);
    }

    for(i = result.size() - 1; i >= 0; i--) {
        if(result[i] != '0')break;
    }

    result = result.substr(0, i+1);

    reverse(result.begin(), result.end());
    if(result.length()==0) result = "0";
    return result;
}
string MULTIPLY(string number1, string number2) {
    int i, j;
    int *iresult;
    int length1 = number1.size();
    int length2 = number2.size();
    string result = "";

    reverse(number1.begin(), number1.end());
    reverse(number2.begin(), number2.end());

    iresult = (int*)malloc(sizeof(int) * (length1 + length2 + 1));
    memset(iresult, 0, sizeof(int) * (length1 + length2 + 1));

    for(i = 0; i < length1; i++) {
        for(j = 0; j < length2; j++) {
            iresult[i+j] += ((number1[i] - 48) * (number2[j] - 48));
        }
    }

    int carry = 0;
    for(i = 0; i < length1 + length2; i++) {
        int value = iresult[i] + carry;
        iresult[i] = value % 10;
        carry = value / 10;
    }

    for(i = length1 + length2 - 1; i >= 0; i--) {
        if(iresult[i] != 0)break;
    }

    for(; i >= 0; i--) {
        result = result + (char)(iresult[i]+48);
    }

    free(iresult);

    if(result == "") result = "0";
    return result;
}
string factorial(string n) {
    string temp = "1";
    string i;
    for(i = "1"; COMPARE(i, n) <= 0; i = PLUS(i, "1")) {
        temp = MULTIPLY(temp, i);
    }
    return temp;
}
int main(void) {
    cout << factorial("100") << endl;
    return 0;
}
Sheldon_ 2014-04-03
  • 打赏
  • 举报
 回复
引用 1 楼 mougaidong 的回复:
问题描述不清楚，再急也白搭。
就是 返回值是double型的。
turing-complete 2014-04-02
  • 打赏
  • 举报
 回复
问题描述不清楚，再急也白搭。
python编程求1!+2!+…+n!_python计算阶乘和的方法(1!+2!+3!+...+n!)
python计算阶乘和的方法(1!+2!+3!+...+n!)更新时间：2019年02月01日 08:50:15 作者：一米阳光里的晴天娃娃今天小编就为大家分享一篇python计算阶乘和的方法(1!+2!+3!+...+n!)，具有很好的参考价值，希望对大家有所帮助。一起跟随小编过来看看吧方法一：使用while循环来计算n = int(input())jie = 1sum = 0i = 1wh...
【C语言】解决n!和求1！+2！+3！+......+n!问题；求前n项和c语言
文章解决问题： 本文章使用C语言解决ｎ！（求一个数的阶乘）；求 1！+2！+3！+4！......+n! 提示：写完文章后，目录可以自动生成，如何生成可参考右边的帮助文档 文章目录 前言 一：求ｎ！问题 二：求 1！+2！+3！+4！......+n! 总结 前言: 1，本篇文章使用Ｃ语言实现解决方案，分别运用for循环，while循环，do..while循环实现解决这一问题 2，使用VS2019平台 一：求ｎ！问题 ***********头文件************.
C语言高精度运算-阶乘累加：1!+2!+3!+...+n!
/* 高精度运算-阶乘累积求和 1+2!+3!...+n! */ # include <stdio.h> # define N 10000 // 数组长度 int main(){ int i, j, k, n, s[N] = { 1 }, a[N] = { 1 }, digit = 1; // s累加和， a累积求阶乘， digit代表的是数字的位数 printf("Plea...
求n!（n的阶乘）和1！+2！+....n! （阶乘求和） ----C语言实现
不少小伙伴搞不清楚n!和n!求和，下面我就列出运用for循环实现求解的简洁方法，一步一步慢慢分析都能搞懂噢~ 1.求n! 算法思想：首先要清楚阶乘定义，所谓 n 的阶乘，就是从 1 开始乘以比前一个数大 1 的数，一直乘到 n，用公式表示就是：1×2×3×4×…×(n-2)×(n-1)×n=n! 具体的操作:利用循环解决问题，设循环变量为 i，初值为 1，i 从 1 变化到 n；依次让 i 与 sum 相乘，并将乘积赋给 sum。 （注意不能初始化为0，0*任何数等于0）； ① 定义变量 sum，并.
求n的阶乘的算法框图_C语言编程求阶乘和： 1!+2!+3!+ ... + n!
儿童节快乐Happy children's Day求阶乘和大家好，我是阿汤哥。先祝各位大朋友、小朋友六一节快乐!今天我们用C语言来求阶乘和。先给出定义：一个正整数n的阶乘等于 1到这个数n之间(包括n)所有整数的乘积。1! = 12！= 1 * 2；3! = 1 * 2 *3;...n! = 1 * 2 * 3 * ... * n;求解思路思路：把这个问题分解，写一个函数，功能是求n的阶...
C++ 语言

64,318

社区成员

250,497

社区内容

发帖
与我相关
我的任务
社区描述
C++ 语言相关问题讨论，技术干货分享，前沿动态等
c++ 技术论坛（原bbs）
社区管理员
  • C++ 语言社区
  • encoderlee
  • paschen
加入社区
  • 近7日
  • 近30日
  • 至今

加载中

查看更多榜单
社区公告
  1. 请不要发布与C++技术无关的贴子
  2. 请不要发布与技术无关的招聘、广告的帖子
  3. 请尽可能的描述清楚你的问题，如果涉及到代码请尽可能的格式化一下

试试用AI创作助手写篇文章吧

+ 用AI写文章