project euler problem 13:Large sum
2013-10-01 13:23
405 查看
Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.
题意:给出一百个50位数字的数,算出他们的和,结果只取前十位数。
思路:这题就POJ中的2109题:K ^ N = P, 给N 和 P, 求K。1<=n<= 200, 1<=p<10101 ,
1<=k<=109;这题用的就是double,因为它的范围达到10^308,所以这题也可以算,因为只用求前十位而已嘛!!答案是:5537376230
题意:给出一百个50位数字的数,算出他们的和,结果只取前十位数。
思路:这题就POJ中的2109题:K ^ N = P, 给N 和 P, 求K。1<=n<= 200, 1<=p<10101 ,
1<=k<=109;这题用的就是double,因为它的范围达到10^308,所以这题也可以算,因为只用求前十位而已嘛!!答案是:5537376230
#include <iostream> #include <map> #include <string> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <queue> #include <set> #include <stack> #include <map> using namespace std; int main() { int i; double sum=0,a; for(i=0;i<100;i++) { cin>>a; sum+=a; } printf("%.0f",sum); return 0; }
相关文章推荐
- Project Euler Problem 13 Large sum
- http://projecteuler.net/problem=13 [Answer:5537376230]
- project euler Problem 13
- Project Euler problem 13
- project euler Problem 13
- Project Euler Problem 23 Non-abundant sums
- Project Euler Problem 34 Digit factorials
- Project Euler Problem 36 Double-base palindromes
- Project Euler Problem 118 Pandigital prime sets
- project euler problem 11
- Project Euler Problem 57
- project euler Problem 33
- Project Euler -> problem 3
- Project Euler Problem 22
- Project Euler Problem 28
- Project Euler Problem 9
- project euler problem 5:Smallest multiple
- Project Euler problem 7
- Project Euler problem 26 分数化小数
- Project Euler problem 36