1. C++ / Говнокод #9826

    +162

    1. 001
    2. 002
    3. 003
    4. 004
    5. 005
    6. 006
    7. 007
    8. 008
    9. 009
    10. 010
    11. 011
    12. 012
    13. 013
    14. 014
    15. 015
    16. 016
    17. 017
    18. 018
    19. 019
    20. 020
    21. 021
    22. 022
    23. 023
    24. 024
    25. 025
    26. 026
    27. 027
    28. 028
    29. 029
    30. 030
    31. 031
    32. 032
    33. 033
    34. 034
    35. 035
    36. 036
    37. 037
    38. 038
    39. 039
    40. 040
    41. 041
    42. 042
    43. 043
    44. 044
    45. 045
    46. 046
    47. 047
    48. 048
    49. 049
    50. 050
    51. 051
    52. 052
    53. 053
    54. 054
    55. 055
    56. 056
    57. 057
    58. 058
    59. 059
    60. 060
    61. 061
    62. 062
    63. 063
    64. 064
    65. 065
    66. 066
    67. 067
    68. 068
    69. 069
    70. 070
    71. 071
    72. 072
    73. 073
    74. 074
    75. 075
    76. 076
    77. 077
    78. 078
    79. 079
    80. 080
    81. 081
    82. 082
    83. 083
    84. 084
    85. 085
    86. 086
    87. 087
    88. 088
    89. 089
    90. 090
    91. 091
    92. 092
    93. 093
    94. 094
    95. 095
    96. 096
    97. 097
    98. 098
    99. 099
    100. 100
    ...
q = new double[50];
c = new double[50];
d = new double[50];
b = new double[50];
s11 = new double[50];
a4 = new double[50];
s1 = new double[50];
int c2 = 0;

for ( int i = 1; i < n1; i++)
{
	h1[i] = a3[i] - a3[i-1];
}
for ( int i = 0; i < n1; i++)
{
	f1[i] = sin(exp(a3[i]));
}
for ( int i = 1; i < k; i++)
{
      al[i] = h1[i];
      bet[i] = 2*(h1[i+1] + h1[i]);
      gam[i] = h1[i+1];
      fi[i] = 6*(((f1[i+1] - f1[i])/h1[i+1]) - ((f1[i] - f1[i-1])/h1[i]));
}
p[1] = 0;
q[1] = 0;
for ( int i = 1; i < k; i++)
{
	p[i+1] = -(gam[i])/(bet[i] + al[i]*p[i]);
	q[i+1] = (fi[i] - al[i]*q[i])/(bet[i] + al[i]*p[i]);
}
c[0] = 0.0;
c[k] = 0.0;
for ( int i = k-1; i > 0; i--)
{
	c[i] = p[i+1]*c[i+1] + q[i+1];
}
for ( int i = 0; i < k; i++)
{
	d[i+1] = (c[i] - c[i+1])/h1[i+1];
	b[i+1] = ((f1[i] - f1[i+1])/h1[i+1]) - ((c[i+1]*h1[i+1])/2) - (((c[i] - c[i+1])*h1[i+1])/6);
}
for ( double j = 0.0; j <= 0.5; j = j + 0.1)
{
	c2 = c2 + 1;
	for ( int i = 1; i < 2; i++)
	{
		spkub = f1[i] + b[i]*(a3[i] - j) + ((c[i]*pow((a3[i] - j), 2))/2) + ((d[i]*pow((a3[i] - j), 3))/6); 
	}
	for (int i = c2 - 1; i < c2; i++)
	{
		a4[i] = j;
		s1[i] = spkub;
	}
}
for ( double j = 0.5; j <= 0.7; j = j + 0.1)
{
	c2 = c2 + 1;
	for ( int i = 2; i < 3; i++)
	{
		spkub = f1[i] + b[i]*(a3[i] - j) + ((c[i]*pow((a3[i] - j), 2))/2) + ((d[i]*pow((a3[i] - j), 3))/6);
	}
	for (int i = c2 - 1; i < c2; i++)
	{
		a4[i] = j;
		s1[i] = spkub;
	}
}
........
for ( double j = 1.4; j <= 1.6; j = j + 0.1)
{
	c2 = c2 + 1;
        for ( int i = 5; i < 6; i++)
	{
		spkub = f1[i] + b[i]*(a3[i] - j) + ((c[i]*pow((a3[i] - j), 2))/2) + ((d[i]*pow((a3[i] - j), 3))/6);
	}
	for (int i = c2 - 1; i < c2; i++)
	{
		a4[i] = j;
		s1[i] = spkub;
	}
}
for ( double j = 1.7; j <= 2.0; j = j + 0.1)
{
	c2 = c2 + 1;
	for ( int i = 6; i < 7; i++)
	{
		spkub = f1[i] + b[i]*(a3[i] - j) + ((c[i]*pow((a3[i] - j), 2))/2) + ((d[i]*pow((a3[i] - j), 3))/6);
	}
	for (int i = c2 - 1; i < c2; i++)
	{
		a4[i] = j;
		s1[i] = spkub;
	}
}
for ( int i = 0; i < c2; i++) 
{
      chart1 -> Series["Кубический сплайн S(x)"] -> Points -> AddXY( a4[i], s1[i]);
}

    Построение кубического сплайна

    Запостил: fayster, 01 Апреля 2012

    Комментарии (6) RSS

    Добавить комментарий