/*程序实现功能:给定一个有序数组(从低到高),求得任意两个元素之间质数的个数,即C(n,2)个组结果,最终总个数。
eg: 2,4,8 ans=prime_sum(2,4)+prime_sum(4,8)+sum(2,8)=1+2+3=6
实现方法:使用动态规划,带备忘的方法解决, m[i,j]=m[i,j-1]+p[j-1] p[j-1]表示第j个元素与第j+1个元素之间的质数个数
或者 m[i,j]=m[i,k]+m[k+1,j],m[i,i+1]=p[i]
*/
eg: 2,4,8 ans=prime_sum(2,4)+prime_sum(4,8)+sum(2,8)=1+2+3=6
实现方法:使用动态规划,带备忘的方法解决, m[i,j]=m[i,j-1]+p[j-1] p[j-1]表示第j个元素与第j+1个元素之间的质数个数
或者 m[i,j]=m[i,k]+m[k+1,j],m[i,i+1]=p[i]
*/
<span style="font-size:14px;">#include <iostream>
#include <vector>
#include <cmath>
#include <climits>
using namespace std;
bool prime(int x)
{
for(int i=2;i<=sqrt(x);i++) ///是否为质数
{
if(x%i==0)
return false;
}
return true;
}
int prime_sum(int x,int y) ///区间内质数个数
{
int counts=0;
for(int i=x;i<=y;i++)
{
if(prime(i))
counts++;
}
return counts;
}
vector<int> calculate(vector<int> &p) ///将有序数组相邻元素之间的质数个数计算出来
{
vector<int> result;
for(int i=0;i<p.size()-1;i++)
result.push_back(prime_sum(p[i],p[i+1]));
return result;
}
int look(vector<vector<int> >& m,vector<int> &p,int i,int j);
void memo(vector<vector<int> >& m,vector<int> &p)
{
int length=p.size()+1;
m=vector< vector<int> >(length);
for(int i=0;i<length;i++)
m[i].resize(length);
for(int i=0;i<length;i++)
for(int j=0;j<length;j++)
{
m[i][j]=INT_MAX;
}
for(int i=0;i<=length-1;i++)
look(m,p,i,length-1);
}
int look(vector<vector<int> >& m,vector<int> &p,int i,int j)
{
int q=0;
if(m[i][j]<INT_MAX)
return m[i][j];
if(i>=j)
m[i][j]=0;
else
{
q=look(m,p,i,j-1)+p[j-1]; ///带备忘的动态规划
m[i][j]=q;
}
return m[i][j];
}
int main()
{
vector<int> test;
test.push_back(4);
test.push_back(6);
test.push_back(16);
test.push_back(32);
test.push_back(60);
test.push_back(66);
test.push_back(70);
test.push_back(71);
test.push_back(80);
test.push_back(99);
test.push_back(114);
test.push_back(126);
test.push_back(136);
test.push_back(138);
test.push_back(140);
vector<int> test_result=calculate(test);
for(vector<int>::iterator iter=test_result.begin();iter!=test_result.end();iter++)
cout<<*iter<<" ";
cout<<endl;
vector<vector<int> > result;
memo(result,test_result);
int total=0;
for(int i=0;i<test_result.size()+1;i++)
{
for(int j=i;j<test_result.size()+1;j++)
{
total+=result[i][j];
cout<<result[i][j]<<" ";
}
cout<<endl;
}
cout<<"There are "<<total<<" prime pairs\n";
return 0;
}</span>