简体   繁体   English

JavaScript中数字2 pow 1000的数字总和是多少

[英]What is the sum of the digits of the number 2 pow 1000 in JavaScript

I'm writing this but not getting output. 我正在写这个,但没有得到输出。
I'm new to solve project Euler problems in JavaScript 我是新来解决JavaScript中的项目Euler问题的人
but getting errors please help me. 但遇到错误,请帮助我。

function pow(n, p) {    
    var r = (n, 0, 0);
    var bn = (n, 0, 0);    
    for (var i = 1; i < p; i++) {    
        r = mult(r, bn);
    }
    return r;
}

function sumDigits(n) {    
    var bns = bigInt2str(n, 10);    
    var dStr = 0;    
    var a = bns.split('');    
    for (i in a) {    
        dStr += parseInt(a[i]);    
    }    
    return dStr;    
}
console.log(sumDigits(pow(2, 1000)));

Please help me 请帮我

You may use: 您可以使用:

function pow(n, p) {
    var r = bigInt(1);  // (n, 0, 0);
    var bn = bigInt(n); //var bn = (n, 0, 0);
    for (var i = 0; i < p; i++) {
        r = r.multiply(bn); //r = mult(r, bn);
    }
    return r;
}

function sumDigits(n) {
    var bns = n.toString(); // bigInt2str(n, 10);
    var dStr = 0;
    var a = bns.split('');
    for (i in a) {
        dStr += parseInt(a[i]);
    }
    return dStr;
}
console.log(sumDigits(pow(2, 1000)));

output: 输出:

1366

ref: 参考:

https://www.npmjs.com/package/big-integer https://www.npmjs.com/package/big-integer

 installation If you are using a browser, you can download BigInteger.js from GitHub or just hotlink to it: <script src="http://peterolson.github.com/BigInteger.js/BigInteger.min.js"></script> If you are using node, you can install BigInteger with npm. npm install big-integer Then you can include it in your code: var bigInt = require("big-integer"); 

And see: https://github.com/peterolson/BigInteger.js 并查看: https : //github.com/peterolson/BigInteger.js

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM