Project Euler:Problem 77 Prime summations
2015-07-18 17:26
423 查看
It is possible to write ten as the sum of primes in exactly five different ways:
7 + 3
5 + 5
5 + 3 + 2
3 + 3 + 2 + 2
2 + 2 + 2 + 2 + 2
What is the first value which can be written as the sum of primes in over five thousand different ways?
7 + 3
5 + 5
5 + 3 + 2
3 + 3 + 2 + 2
2 + 2 + 2 + 2 + 2
What is the first value which can be written as the sum of primes in over five thousand different ways?
#include <iostream> #include <string> using namespace std; int prime[1000]; //存储前1000个质数 bool vis[10000]; void getPrime() { int count = 0; memset(vis, 0, sizeof(vis)); for (int i = 2; i < 10000; i++) { if (!vis[i]) { if (count >= 1000) break; prime[count++] = i; for (int j = i*i; j < 10000; j += i) vis[j] = 1; } } } int main() { getPrime(); int *ways; int num = 2; while (true) { ways = new int[num+1]; for (int i = 0; i < num + 1; i++) ways[i] = 0; ways[0] = 1; for (int i = 0; i < 1000; i++) { for (int j = prime[i]; j <= num; j++) { ways[j] += ways[j - prime[i]]; } } //cout << num <<" " << ways[num]<< endl; if (ways[num]>5000) break; else num++; } cout << num << endl; system("pause"); return 0; }
相关文章推荐
- hdu 1054 Strategic Game 匈牙利算法 || Hopcroft-Carp算法
- 网站制作实战积累-内DIV的margin溢出问题
- isArray()方法 判定此Class对象是否表示一个数组类
- 微信公众号提交开发者提示token验证失败
- Centos7 搭建hadoop2.6 HA
- MySQL-SQL_CALC_FOUND_ROWS
- web.xml文件配置详解以及实例说明
- xcode6 如何通过开发证书导出项目ipa包
- error: failed to push some refs【Linux】【Git】
- OpenMP:向量内积
- RapidFloatingActionButton
- 合并库命令
- hdu 3576
- 当一个对象被当做参数传递到一个方法后,此方法可改变这个对象的属性,并可返回变化后的结果,那么这里到底是值传递还是引用传递?
- 存档模式 Memento
- 服务器处理静态文件请求
- 理解性能你需要知道的一些事情
- OC_属性
- Spring定时任务的几种实现
- web.xml文件配置详解以及实例说明