project euler 16 Power digit sum
来源:互联网 发布:中子星 知乎 编辑:程序博客网 时间:2024/05/29 11:51
题目:
https://projecteuler.net/problem=16
题意:
Power digit sum
Problem 16
215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number21000 ?
求
思路:
直接求出
代码:
#include <bits/stdc++.h>using namespace std;typedef long long ll;const int N = 1000 + 10;const int RADIX = 10000;int big_int_pow(int x, int y, int num[])//求x^y,结果到保存在num数组中{ //这里要求x、y均小于10000,因为RADIX=10000 int len = 0; num[len++] = 1; for(int i = 0; i < y; ++i) { int temp = 0; for(int j = 0; j < len; ++j) { temp += x * num[j]; num[j] = temp % RADIX; temp /= RADIX; } if(temp) num[len++] = temp; } reverse(num, num + len); return len;}int main(){ int num[N]; int len = big_int_pow(2, 1000, num); int ans = 0; for(int i = len-1; i >= 0; --i) { int temp = num[i]; while(temp) { ans += temp % 10; temp /= 10; } } printf("%d\n", ans); return 0;}
阅读全文
0 0
- Project Euler 16: Power digit sum.
- Project Euler 题解 #16 Power digit sum
- Project Euler:Problem 16 Power digit sum
- 16 Power digit sum - Project Euler
- Project Euler Problem 16 Power digit sum
- project euler 16 Power digit sum
- Project Euler 题解 #20 Factorial digit sum
- Project Euler:Problem 20 Factorial digit sum
- Project Euler:Problem 56 Powerful digit sum
- 20 Factorial digit sum - Project Euler
- Project Euler Problem 20 Factorial digit sum
- project euler 20 Factorial digit sum
- Problem 16:Power digit sum
- Problem 16:Power digit sum
- PE 16 Power digit sum
- Problem 16 Power digit sum
- Project Euler 20 Factorial digit sum(大数乘法)
- Matlab 编程 Project Euler Problem 20 Factorial digit sum
- php单点登录
- 你真得理解 python 的浅拷贝和深拷贝吗?
- 1线程安全
- 谈谈程序员的离职和跳槽
- OpenXml生成Word
- project euler 16 Power digit sum
- 图片上传-并发性知识
- 谈谈Shiro的原理及在SSM和SpringBoot两种环境下的使用姿势(上篇)
- js导出excel表格
- Qt构建、运行、qmake的区别
- thrift/swift:ThriftMethodProcessor代码分析
- ssh免密码登陆
- C#_类和方法
- 打包 【SSL JudgeOnline 2294】