数学代码函数库 -----持续更新

#include <bits/stdc++.h>
using namespace std;

long long factorial(int n);//longlong facorial function(not used too much
int get_digit(int n);
int get_digit(long long n);//two function to get a number's digit
int get_simple(int n, int num, bool tmp);
// int get_simple(long long n, int num, bool tmp);
// two function to get a simple number tmp = true left ,false right
bool is_square(long long num);


//---------------------------------------------------------------------

long long factorial(int n) {
	if (n == 1 || n == 0) {
		return 1;
	} else {
		return n * (factorial(n - 1));
	}
}

int get_digit(int n) {
	int ans = 0;
	while (n != 0) {
		ans++;
		n /= 10;
	}
	return ans;
}

int get_digit(long long n) {
	int ans = 0;
	while (n != 0) {
		ans++;
		n /= 10;
	}
	return ans;
}

int get_simple(int n, int num, bool tmp) {
	int weishu = 0;
	if (tmp) {
		weishu = get_digit(n) - num + 1;
	} else {
		weishu = num;
	}
	int ans = 0;
	ans = int(n / (pow(10, weishu - 1))) % 10;
	return ans;
}

bool is_square(long long num) {
	if (pow(int(sqrt(num)), 2) == num) {
		return true;
	} else {
		return false;
	}
}