【DP】最大约数和

最大约数和

选取和不超过S的若干个不同的正整数，使得所有数的约数（不含它本身）之和最大。

样例输入

11

样例输出

9

思路

算出每个数的约数和，然后DP
$a[i]$代表$第i$个数的最大约数和
因为我怕在主程序里算约数和会超时，所以我直接打表
以下是打表用的
（注意这里是到2000的）

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int fz(int k)
{
   
	int ans=0;
	for(int i=1;i<=sqrt(k);++i)
		if(k%i==0)
		{
   
			if(k/i!=i)ans+=(i+k/i);
			else ans+=i;
		}
	return ans-k;
}
int main()
{
   
	freopen("腐竹.in","w",stdout);
	printf("{");
	for(int i=1;i<=1999;++i)
		printf("%d,",fz(i));
	printf("%d}",fz(2000));
	return 0;
}

其实也可以直接写到主程序里，但这里用的是打表
以下是DP正解

#include<iostream>
#include<cstdio>
using namespace std;
int a[2002]={
   0,0,1,1,3,1,6,1,7,4,8,1,16,1,10,9,15,1,21,1,22,11,14,1,36,6,16,13,28,1,42,1,31,15,20,13,55,1,22,17,50,1,54,1,40,33,26,1,76,8,43,21,46,1,66,17,64,23,32,1,108,1,34,41,63,19,78,1,58,27,74,1,123,1,40,49,64,19,90,1,106,40,44,1,140,23,46,33,92,1,144,21,76,35,50,25,156,1,73,57,117,1,114,1,106,87,56,1,172,1,106,41,136,1,126,29,94,65,62,25,240,12,64,45,100,31,186,1,127,47,122,1,204,27,70,105,134,1,150,1,196,51,74,25,259,35,76,81,118,1,222,1,148,81,134,37,236,1,82,57,218,31,201,1,130,123,86,1,312,14,154,89,136,1,186,73,196,63,92,1,366,1,154,65,176,43,198,29,148,131,170,1,316,1,100,141,203,1,270,1,265,71,104,37,300,47,106,105,226,31,366,1,166,75,110,49,384,39,112,77,284,31,234,1,280,178,116,1,332,1,202,153,218,1,312,53,184,83,194,1,504,1,157,121,190,97,258,33,232,87,218,1,476,35,130,177,255,1,270,45,328,129,134,1,456,59,214,93,208,1,450,1,286,175,140,97,396,1,142,137,440,1,294,1,220,195,218,49,531,18,250,101,226,1,390,65,274,183,152,37,568,51,154,105,316,67,396,1,364,107,266,1,528,1,160,309,244,1,330,41,442,111,254,37,523,109,166,113,302,55,534,1,256,161,170,73,656,1,211,117,416