-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAMath.h
More file actions
216 lines (204 loc) · 3.9 KB
/
Copy pathAMath.h
File metadata and controls
216 lines (204 loc) · 3.9 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
// عداد ثابت در ریاضی و بعضی تعریفات
float piNum = 3.141592653589793; // عدد پی
float NpNum = 2.718281828459045; //عدد نپر
//////
//Math Part
//1
int power(int a,int b)
{
if (b==0)
{
return 1;
}
else
{
return a*power(a,b-1);
}
}
//2
float sqr(int x , int y=2)
{
for (double i = 0; ; i+=0.001)
{
if ((power(i*100,y)/10000)>= x)
{
return i;
}
}
}
//3
int fuctoriel(int n)
{
if (n==1)
{
return 1;
}
else{
return n*fuctoriel(n-1);
}
}
//4
int sum2(int a,int b)
{
return a+b;
}
//5
int sum3(int a,int b,int c)
{
return a+b+c;
}
//6
int sum4(int a,int b,int c,int d)
{
return a+b+c+d;
}
//7
int SumArrey(int Numbers[])
{
long int FullNumber;
for (int i = 0; Numbers[i+1]!='\0'; i++)
{
FullNumber=FullNumber+Numbers[i];
}
return FullNumber;
}
//8
float powerF(float base, float exp) {
if (exp == 0.0f) return 1.0f;
float result = 1.0f;
// فقط integer part (برای سادگی؛ fractional رو تقریبی)
int int_exp = static_cast<int>(exp);
float frac_exp = exp - int_exp;
// integer power با loop
for (int i = 0; i < int_exp; ++i) {
result *= base;
}
// fractional تقریبی (با Taylor: base^frac ≈ 1 + frac * ln(base)، اما ln نیاز داره)
// ساده: برای demo، از ۱ + frac * (base-1) استفاده کن (خطی، نادقیق برای frac بزرگ)
result *= (1.0f + frac_exp * (base - 1.0f)); // تقریبی
return result;
}
//9
double abs(double x) {
return x < 0 ? -x : x;
}
//10
float Log(float n) {
if (n <= 0.0f) {
return 0.0f;
}
if (n == 1.0f) return 0.0f;
float low = -100000.0f; // برای n<1
float high = 100000.0f;
float precision = 1e-6f;
while (abs(high - low) > precision) {
float mid = (low + high) / 2.0f;
float pow_mid = powerF(10.0f, mid);
if (pow_mid < n) {
low = mid;
} else {
high = mid;
}
}
return (low + high) / 2.0f;
}
//11
float sin(int deg)
{
double x = deg * 3.141592653589793 /(double) 180.0; // تبدیل به رادیان
double result = 0, term = x;
int sign = 1;
for(int i = 1; i <= 15; i += 2) {
result += sign * term;
term *= x * x / ((i + 1) * (i + 2));
sign = -sign;
}
return result;
}
//12
double cos(int deg)
{
double x = deg * 3.141592653589793 /(double) 180.0; // تبدیل به رادیان
double result=1;
double term = 1;
for(int i=1 ; i<=5 ; i ++)
{
term *= (-1) * x * x / ((2*i - 1) * (2*i));
result += term;
}
return result;
}
//13
double tan(int deg)
{
double result = sin(deg)/cos(deg);
return result;
}
float triangle(int x, int y)
{
float z = sqr(power(x,2)+power(y,2));
return z;
}
//14
float sinS(int x , int y , int z)
{
return y/(float)z;
}
//15
float cosS(int x , int y , int z)
{
return y/(float)z;
}
//16
float tanS(int x , int y , int z)
{
return y/(float)z;
}
//17
int arcsin(float x)
{
for (int i = 0;; i++)
{
if (sin(i)>= x)
{
return i ;
}
}
}
//18
int arccos(float x)
{
for (int i = 0;; i++)
{
if (cos(i)<= x)
{
return i ;
}
}
}
//19
float speed(float distanse,float time)
{
float speed = distanse / time ;
return speed;
}
//20
float vrite(float distanse,float time)
{
float speed = distanse / time ;
return speed;
}
//21
int det2(int A[2][2])
{
long int C =( A[0][0]*A[1][1]) - (A[0][1]*A[1][0]);
return C;
}
//22
int det3(int A[3][3])
{
int C = A[0][0] * (A[1][1]*A[2][2] - A[1][2]*A[2][1]) -
A[0][1] * (A[1][0]*A[2][2] - A[1][2]*A[2][0]) +
A[0][2] * (A[1][0]*A[2][1] - A[1][1]*A[2][0]);
return C;
}