version 1.0.0

Author: MarufHasan24

const.cpp

@@ -0,0 +1,25 @@
+namespace mathlib {
+    long double h= 6.62607004e-34,
+    G= 6.67428e-11,
+    g= 9.80665,
+    mE= 5.97219e24,
+    gM= 1.634441667,
+    gMr= 2.4516625,
+    Na= 6.02214086e23,
+    c= 299792458,
+    Phi= 1.6180339887498948482,
+    W= 2.09455148154232659148,
+    G1= 0.83462684167407318628,
+    K= 1.380649e-23,
+    Me= 9.1093837015e-31,
+    Mp= 1.67262192369e-27,
+    Mn= 1.67492749804e-27,
+    ge= -2.00231930436256,
+    c12= 1.6605390395999472e-24,
+    F= 96485.33,
+    Ce= -1.602176e-19,
+    Cp= 1.602176e-19,
+    Ri= 1.0973731568539,
+    B3= 0.83564884826472105333,
+    G0= 7.7480917e-5;
+};

index.cpp

@@ -0,0 +1,177 @@
+#include <cmath>
+#include <bits/stdc++.h>
+
+namespace mathlib {
+    // Function to add two or more numbers
+    double add(int a[], int len){
+        double sum = 0;
+        for(int i = 0; i < len; i++){
+            sum += a[i];
+        }
+        return sum;
+    }
+    // Function to subtract between two or more numbers
+    double sub(int a[], int len){
+        double sum = 0;
+        for(int i = 0; i < len; i++){
+            sum -= a[i];
+        }
+        return sum;
+    }
+    // Function to multiply two or more numbers
+    double mul(int a[], int len){
+        double sum = 1;
+        for(int i = 0; i < len; i++){
+            sum *= a[i];
+        }
+        return sum;
+    }
+    // Function to divide between two or more numbers
+    float div(int a[], int len){
+        float sum = 1;
+        for(int i = 0; i < len; i++){
+            sum /= a[i];
+        }
+        return sum;
+    }
+    // Function to find average of two or more numbers
+    float avg(int a[], int len){
+        float sum = 0;
+        for(int i = 0; i < len; i++){
+            sum += a[i];
+        }
+        return sum/len;
+    }
+    // Function to find log of x to for custom base
+    float logx(int base, int x){
+        return log(x)/log(base);
+    }
+    // Function to find root of x to for custom base
+    float rootx(int base, int x){
+        return pow(x, 1.0/base);
+    }
+    // Function to generate random number between min and max
+    int random(int min, int max){
+        if(min > max){
+            int temp = min;
+            min = max;
+            max = temp;
+        }
+        return rand()%(max-min + 1) + min;
+    }
+    // Function to find limit of a function
+    double limit(int tt, double (*fc)(double))
+    {
+        int n;
+        double a = pow(10,-7);
+        double lim = (fc(tt - a) + fc(tt + a)) / 2;
+        return lim;
+    }
+    // Function to find factorial of a number
+    double fact(int n){
+        if(n == 0){
+            return 1;
+        }
+        return n*fact(n-1);
+    }
+     /* Function to find 2 linear equations solution from a, b, c of both equations. like ax + by = c */
+    float* linearEq(float x[], float y[]){
+        static float result[2];
+        float a1 = x[0], b1 = x[1], c1 = x[2], a2 = y[0], b2 = y[1], c2 = y[2];
+        result[0] = (c1 * b2 - c2 * b1) / (a1 * b2 - b1 * a2);
+        result[1] = (a1 * c2 - a2 * c1) / (a1 * b2 - a2 * b1);
+        return result;
+    }
+     /* Function to find quadratic equation solution from a, b, c of equation. like ax^2 + bx + c = 0 */
+    float* quadEq(float a, float b, float c){
+        float d = pow(b, 2) - 4 * a * c;
+        static float result[2];
+        if(d > 0){
+            result[0] = (-b + sqrt(d)) / (2 * a);
+            result[1] = (-b - sqrt(d)) / (2 * a);
+        }else if(d == 0){
+            result[0] = result[1] = -b / (2 * a);
+        }else{
+            result[0] = result[1] = nan("");
+        }
+        return result;
+    }
+    // check if a number is prime or not
+    bool isPrime(int n){
+        if(n <= 1){
+            return false;
+        }
+        else {
+            for(int i = 2; i <= n; i++){
+                if(n%i == 0){
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+    // check if a number is odd or not
+    bool isOdd(int n){
+        if(n%2 == 0){
+            return false;
+        }
+        return true;
+    }
+    // get summation of a series
+    double sums(int start, int end, double (*fc)(double)){
+        if(start > end){
+            int temp = start;
+            start = end;
+            end = temp;
+        }
+        double sum = 0;
+        for(int i = start; i <= end; i++){
+            sum += fc(i);
+        }
+        return sum;
+    }
+    // get combination of nCr
+    double combo(int n, int r){
+        if(n>=0 && r>=0 && n>=r){
+           return fact(n)/(fact(r)*fact(n-r));
+        }else{
+            return nan("");
+        }
+    }
+    // get permutation of nPr
+    double permt(int n, int r){
+        if(n>=0 && r>=0 && n>=r){
+           return fact(n)/fact(n-r);
+        }else{
+            return nan("");
+        }
+    }
+    // get gcd of two numbers
+    int gcd(int a, int b){
+        if(a == 0){
+            return b;
+        }
+        return gcd(b%a, a);
+    }
+    // get lcm of two numbers
+    int lcm(int a, int b){
+        return (a*b)/gcd(a, b);
+    }
+    // get all prime numbers between two numbers
+    int* primes(int start, int end){
+        if(start > end){
+            int temp = start;
+            start = end;
+            end = temp;
+        }
+        static int result[100];
+        int j = 0;
+        for(int i = start; i <= end; i++){
+            if(isPrime(i)){
+                j++;
+                result[j] = i;
+            }
+        }
+        return result;
+    }
+}

mesure.cpp

@@ -0,0 +1,55 @@
+#include <cmath>
+#include <bits/stdc++.h>
+#define PI 3.141592653589793
+namespace mathlib {
+    // Function to measure length of a line from it's edge points 
+    float lineWidth(int x[], int y[]){
+        return sqrt(pow(x[1]-x[0], 2) + pow(y[1]-y[0], 2));
+    }
+    // Function to measure Perimeter from edge points
+    float Perimeter(int towD[][2], int len){
+        float sum = 0;
+        for(int i = 0; i < len-1; i++){
+            sum += lineWidth(towD[i], towD[i+1]);
+        }
+        sum += lineWidth(towD[len-1], towD[0]);
+        return sum;  
+    }
+    // Function to measure area of a rectangle from it's edge points
+    float Area(int towD[][2], int len){
+        float sum = 0;
+        for(int i = 0; i < len-1; i++){
+            sum += towD[i][0]*towD[i+1][1] - towD[i+1][0]*towD[i][1];
+        }
+        sum += towD[len-1][0]*towD[0][1] - towD[0][0]*towD[len-1][1];
+        return abs(sum/2);
+    }
+    // Function to measure volume of a cuboid from it's edge points
+    float Volume(int threeD[][3], int len){
+        float sum = 0;
+        for(int i = 0; i < len-1; i++){
+            sum += threeD[i][0]*threeD[i+1][1]*threeD[i+2][2] - threeD[i+2][0]*threeD[i+1][1]*threeD[i][2];
+        }
+        sum += threeD[len-1][0]*threeD[0][1]*threeD[1][2] - threeD[1][0]*threeD[0][1]*threeD[len-1][2];
+        return abs(sum/6);
+    }
+    // Function to measure surface area of a cuboid from it's edge points
+    float SurfaceArea(int threeD[][3], int len){
+        float sum = 0;
+        for(int i = 0; i < len-1; i++){
+            sum += lineWidth(threeD[i], threeD[i+1])*lineWidth(threeD[i+1], threeD[i+2]);
+        }
+        sum += lineWidth(threeD[len-1], threeD[0])*lineWidth(threeD[0], threeD[1]);
+        return abs(sum*2);
+    }
+    float* tringleAngle(int x[], int y[], int z[]){
+        float a = lineWidth(x, y);
+        float b = lineWidth(y, z);
+        float c = lineWidth(z, x);
+        static float result[3];
+        result[0] = acos((pow(b, 2) + pow(c, 2) - pow(a, 2))/(2*b*c));
+        result[1] = acos((pow(a, 2) + pow(c, 2) - pow(b, 2))/(2*a*c));
+        result[2] = acos((pow(a, 2) + pow(b, 2) - pow(c, 2))/(2*a*b));
+        return result;
+    }
+}