<?xml version='1.0' encoding="utf-8"?>
      <rss version='2.0'>
      <channel>
      <title>Форум на Исходниках.RU</title>
      <link>https://forum.sources.ru</link>
      <description>Форум на Исходниках.RU</description>
      <generator>Форум на Исходниках.RU</generator>
  	
      <item>
        <guid isPermaLink='true'>https://forum.sources.ru/index.php?showtopic=104538&amp;view=findpost&amp;p=794677</guid>
        <pubDate>Fri, 02 Nov 2001 15:21:00 +0000</pubDate>
        <title>аппроксимация</title>
        <link>https://forum.sources.ru/index.php?showtopic=104538&amp;view=findpost&amp;p=794677</link>
        <description><![CDATA[Alone God: Вот, из старых запасов:<br>
<div class='tag-code'><span class='pre_code'></span><div class='code  code_collapsed ' title='Подсветка синтаксиса доступна зарегистрированным участникам Форума.' style=''><div><div><ol type="1"><div class="code_line">Program Ex1ForEGA;</div><div class="code_line">&nbsp;&nbsp;Uses Graph,PGraph;</div><div class="code_line">&nbsp;&nbsp;Const</div><div class="code_line">&nbsp;&nbsp; &nbsp;Nmax=50;</div><div class="code_line">&nbsp;&nbsp;Var</div><div class="code_line">&nbsp;&nbsp; &nbsp;a:array [0..1] of real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;b:array [0..2] of real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;c:array [0..3] of real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;x,y:array [1..Nmax] of real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;f:text;</div><div class="code_line">&nbsp;&nbsp; &nbsp;n,i,j:integer;</div><div class="code_line">&nbsp;&nbsp; &nbsp;u:array [1..4,1..4] of real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;r:array [1..4] of real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;MaxX,MinX,KX,MaxY,MinY,KY:real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;St1,St2,St3:string;</div><div class="code_line">&nbsp;&nbsp;Function f1(x:real):real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;Begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;f1:=a[0]+a[1]*x;</div><div class="code_line">&nbsp;&nbsp; &nbsp;End;</div><div class="code_line">&nbsp;&nbsp;Function f2(x:real):real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;Begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;f2:=b[0]+b[1]*x+b[2]*x*x;</div><div class="code_line">&nbsp;&nbsp; &nbsp;End;</div><div class="code_line">&nbsp;&nbsp;Function f3(x:real):real;</div><div class="code_line">&nbsp;&nbsp; &nbsp;Begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;f3:=c[0]+c[1]*x+c[2]*x*x+c[3]*x*x*x;</div><div class="code_line">&nbsp;&nbsp; &nbsp;End;</div><div class="code_line">&nbsp;&nbsp;Procedure PStep(n1,n2:byte);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Var</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;i,j:byte;</div><div class="code_line">&nbsp;&nbsp; &nbsp;Begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if n1=n2 then</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp;r[n1]:=r[n1]/u[n1,n1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;u[n1,n1]:=1;</div><div class="code_line">&nbsp;&nbsp; &nbsp;Exit;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[n1]:=r[n1]/u[n1,n1];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;For i:=n1+1 to n2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; u[n1,i]:=u[n1,i]/u[n1,n1];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[n1,n1]:=1;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;For i:=n1+1 to n2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp;For j:=n1+1 to n2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; u[i,j]:=u[i,j]-u[i,n1]*u[n1,j];</div><div class="code_line">&nbsp;&nbsp; &nbsp;r[i]:=r[i]-u[i,n1]*r[n1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;u[i,n1]:=0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;PStep(n1+1,n2);</div><div class="code_line">&nbsp;&nbsp; &nbsp;End;</div><div class="code_line">&nbsp;&nbsp;Procedure OStep(n:byte);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Var</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Sv:real;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;i,j,k:byte;</div><div class="code_line">&nbsp;&nbsp; &nbsp;Begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;for i:=n downto 2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; For j:=1 to i-1 do</div><div class="code_line">&nbsp;&nbsp; &nbsp;begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; Sv:=u[j,i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; For k:=1 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[j,k]:=u[j,k]-Sv*u[i,k];</div><div class="code_line">&nbsp;&nbsp; &nbsp; r[j]:=r[j]-Sv*r[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp;end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;End;</div><div class="code_line">&nbsp;</div><div class="code_line">&nbsp;&nbsp;Begin</div><div class="code_line">&nbsp;&nbsp; &nbsp;Assign(f,&#39;EX1.DAT&#39;{ParamStr(1)});</div><div class="code_line">&nbsp;&nbsp; &nbsp;Reset(f);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Readln(f,n);</div><div class="code_line">&nbsp;&nbsp; &nbsp;If n&#62;Nmax then Exit;</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; Readln(f,x[i],y[i]);</div><div class="code_line">&nbsp;&nbsp; &nbsp;n:=n-1;</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to 2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; For j:=1 to 2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; u[i,j]:=0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; r[i]:=0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,1]:=u[1,1]+1;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,2]:=u[1,2]+x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,1]:=u[2,1]+x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,2]:=u[2,2]+x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[1]:=r[1]+y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[2]:=r[2]+x[i]*y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;PStep(1,2);</div><div class="code_line">&nbsp;&nbsp; &nbsp;OStep(2);</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=0 to 1 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; a[i]:=r[i+1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to 3 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; For j:=1 to 3 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; u[i,j]:=0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; r[i]:=0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,1]:=u[1,1]+1;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,2]:=u[1,2]+x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,3]:=u[1,3]+x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,1]:=u[2,1]+x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,2]:=u[2,2]+x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,3]:=u[2,3]+x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[3,1]:=u[3,1]+x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[3,2]:=u[3,2]+x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[3,3]:=u[3,3]+x[i]*x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[1]:=r[1]+y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[2]:=r[2]+x[i]*y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[3]:=r[3]+x[i]*x[i]*y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;PStep(1,3);</div><div class="code_line">&nbsp;&nbsp; &nbsp;OStep(3);</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=0 to 2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; b[i]:=r[i+1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to 4 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; For j:=1 to 4 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; u[i,j]:=0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; r[i]:=0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,1]:=u[1,1]+1;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,2]:=u[1,2]+x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,3]:=u[1,3]+x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[1,4]:=u[1,4]+x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,1]:=u[2,1]+x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,2]:=u[2,2]+x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,3]:=u[2,3]+x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[2,4]:=u[3,3]+x[i]*x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[3,1]:=u[3,1]+x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[3,2]:=u[3,2]+x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[3,3]:=u[3,3]+x[i]*x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[3,4]:=u[3,4]+x[i]*x[i]*x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[4,1]:=u[4,1]+x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[4,2]:=u[4,2]+x[i]*x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[4,3]:=u[4,3]+x[i]*x[i]*x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;u[4,4]:=u[4,4]+x[i]*x[i]*x[i]*x[i]*x[i]*x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[1]:=r[1]+y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[2]:=r[2]+x[i]*y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[3]:=r[3]+x[i]*x[i]*y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;r[4]:=r[4]+x[i]*x[i]*x[i]*y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;PStep(1,4);</div><div class="code_line">&nbsp;&nbsp; &nbsp;OStep(4);</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=0 to 3 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; c[i]:=r[i+1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;n:=n+1;</div><div class="code_line">&nbsp;&nbsp; &nbsp;MaxX:=x[1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;MinX:=x[1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=2 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MaxX&#60;x[i] then MaxX:=x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MinX&#62;x[i] then MinX:=x[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;KX:=460/(MaxX-MinX);</div><div class="code_line">&nbsp;&nbsp; &nbsp;MaxY:=y[1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;MinY:=y[1];</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=2 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MaxY&#60;y[i] then MaxY:=y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MinY&#62;y[i] then MinY:=y[i];</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=30 to 490 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MaxY&#60;f1((i-30)/KX+MinX) then MaxY:=f1((i-30)/KX+MinX);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MinY&#62;f1((i-30)/KX+MinX) then MinY:=f1((i-30)/KX+MinX);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MaxY&#60;f2((i-30)/KX+MinX) then MaxY:=f2((i-30)/KX+MinX);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MinY&#62;f2((i-30)/KX+MinX) then MinY:=f2((i-30)/KX+MinX);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MaxY&#60;f3((i-30)/KX+MinX) then MaxY:=f3((i-30)/KX+MinX);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;if MinY&#62;f3((i-30)/KX+MinX) then MinY:=f3((i-30)/KX+MinX);</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;KY:=420/(MaxY-MinY);</div><div class="code_line">&nbsp;&nbsp; &nbsp;OpenGraph;</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(White);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Rectangle(20,20,500,460);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Rectangle(500,20,620,460);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Rectangle(500,20,620,70);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Rectangle(500,140,620,230);</div><div class="code_line">&nbsp;&nbsp; &nbsp;if MinX*MaxX&#60;=0 then</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(30-round(KX*MinX),30,30-round(KX*MinX),450);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(30-round(KX*MinX),30,25-round(KX*MinX),50);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(30-round(KX*MinX),30,35-round(KX*MinX),50);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(25-round(KX*MinX),50,35-round(KX*MinX),50);</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;if MinY*MaxY&#60;=0 then</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(30,450+round(KY*MinY),490,450+round(KY*MinY));</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(490,450+round(KY*MinY),470,455+round(KY*MinY));</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(490,450+round(KY*MinY),470,445+round(KY*MinY));</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Line(470,455+round(KY*MinY),470,445+round(KY*MinY));</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(Red);</div><div class="code_line">&nbsp;&nbsp; &nbsp;Line(30,450-round(KY*(f1(MinX)-MinY)),</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; 490,450-round(KY*(f1(MaxX)-MinY)));</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(Green);</div><div class="code_line">&nbsp;&nbsp; &nbsp;MoveTo(30,450-round(KY*(f2(MinX)-MinY)));</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=31 to 490 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;LineTo(i,450-round(KY*(f2((i-30)/KX+MinX)-MinY)));</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(Blue);</div><div class="code_line">&nbsp;&nbsp; &nbsp;MoveTo(30,450-round(KY*(f3(MinX)-MinY)));</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=31 to 490 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;LineTo(i,450-round(KY*(f3((i-30)/KX+MinX)-MinY)));</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(Yellow);</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetFillStyle(1,Yellow);</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=1 to n do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;FillEllipse(30+round(KX*(x[i]-MinX)),450-round(KY*(y[i]-MinY)),2,2);</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(Red);</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=0 to 1 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Str(i,St1);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Str(a[i]:-10:5,St2);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;St3:=&#39;a&#39;+St1+&#39;=&#39;+St2;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;OutTextXY(510,i*20+30,St3);</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(Green);</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=0 to 2 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Str(i,St1);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Str(b[i]:-10:5,St2);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;St3:=&#39;b&#39;+St1+&#39;=&#39;+St2;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;OutTextXY(510,i*20+80,St3);</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;SetColor(Blue);</div><div class="code_line">&nbsp;&nbsp; &nbsp;For i:=0 to 3 do</div><div class="code_line">&nbsp;&nbsp; &nbsp; begin</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Str(i,St1);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;Str(c[i]:-10:5,St2);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;St3:=&#39;c&#39;+St1+&#39;=&#39;+St2;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;OutTextXY(510,i*20+150,St3);</div><div class="code_line">&nbsp;&nbsp; &nbsp; end;</div><div class="code_line">&nbsp;&nbsp; &nbsp;Readln;</div><div class="code_line">&nbsp;&nbsp; &nbsp;CloseGraph;</div><div class="code_line">&nbsp;&nbsp;End.</div></ol></div></div></div></div><script>preloadCodeButtons('1');</script>]]></description>
        <author>Alone God</author>
        <category>Алгоритмы</category>
      </item>
	
      <item>
        <guid isPermaLink='true'>https://forum.sources.ru/index.php?showtopic=104538&amp;view=findpost&amp;p=794676</guid>
        <pubDate>Sat, 13 Oct 2001 09:09:00 +0000</pubDate>
        <title>аппроксимация</title>
        <link>https://forum.sources.ru/index.php?showtopic=104538&amp;view=findpost&amp;p=794676</link>
        <description><![CDATA[Marsel: Нужна программа для аппроксимации методом наименьших квадратов, подскажите где взять.]]></description>
        <author>Marsel</author>
        <category>Алгоритмы</category>
      </item>
	
      </channel>
      </rss>
	