代码要求模板

（一）1.题目要求：已知m个点的坐标，且知道以该点为圆心对应的半径，现在需要求在500*500的正方形还能画多少个以已知m个半径的平均值为半径的圆，满足下面的约束条件，i，j不相等，m<i<=n,1<=j<=mx&lijx2.数据验证：假设m=23，已知点的坐标和半径x=[407.3618456.6879139.2491482.4443478.583570.9432396.103717.8558339.3676196.1135353.023023.0857347.414317.2230382.7584244.8822354.6824339.851359.4988170.1929375.6335349.5384273.6078]y=[452.8960316.1796273.440878.8065242.6878210.8806479.7462424.5647378.8701327.738915.916448.5659158.5497219.3722397.6000222.7931377.3433327.5490249.1820292.6339127.5476445.451669.3122]r=[0.54530.48662.74812.77742.33692.63061.95512.68932.19000.66280.95652.39562.74811.22080.72151.92570.95650.66282.74810.80961.57332.74810.6041]3.要求：写出1的通用代码，然后将2的数据带入进行检验，并且将数据验证的结果画成图（二）1.题目：已知m个点的坐标，且知道每个点对应的hi，其中每个点对应的半径与hi满足2ri=0.5874*hi-0.1429，现在要求调整hi，使的这m个圆的面积之和最大，求出最大值以及最大值对应的ri。满足下面约束条件：&xlijxi2.数据验证：假设m=23，已知点坐标，对应高度和半径x=[407.3618456.6879139.2491482.4443478.583570.9432396.103717.8558339.3676196.1135353.023023.0857347.414317.2230382.7584244.8822354.6824339.851359.4988170.1929375.6335349.5384273.6078]y=[452.8960316.1796273.440878.8065242.6878210.8806479.7462424.5647378.8701327.738915.916448.5659158.5497219.3722397.6000222.7931377.3433327.5490249.1820292.6339127.5476445.451669.3122]h=[2.10001.90009.60009.70008.20009.20006.90009.40007.70002.50003.50008.40009.60004.40002.70006.80003.50002.50009.60003.00005.60009.60002.3000]r=[0.54530.48662.74812.77742.33692.63061.95512.68932.19000.66280.95652.39562.74811.22080.72151.92570.95650.66282.74810.80961.57332.74810.6041]3.要求：写出1的通用代码，然后将2的数据带入进行检验，并且将数据验证的结果与原数据在图中进行对比（三）1.题目：（1）要求在面积为300的正方形中，ri=0.22225，1<=i<=n,1<=i<=n,求n的最大值xi−&lijx（2）第i个点的价格10*hi+10第i个点的覆盖面积π*ri^22ri=0.5